On graphs with a given endomorphism monoid

Hedrlín and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M . In this paper we give a construction G(M) for a graph with prescribed endomorphism monoid M . Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids. For example we show that for every monoid M , | M |=m there is a graph G with End(G)? M and |E(G)|≤(1 + 0(1))m². This is, up to a factor of 1/2, best possible since there are monoids requiring a graph with \begin{eqnarray*} && \frac{m^{2}}{2}(1 -0(1)) \end{eqnarray*} edges. We state bounds for the class of all monoids as well as for certain subclasses—groups, k‐cancellative monoids, commutative 3‐nilpotent monoids, rectangular groups and completely simple monoids. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 241–262, 2009     

Some recollections on early work with Jan Pelant

In this note we consider three questions which can be traced to our early collaboration with Jan “Honza” Pelant. We present them from the contemporary perspective, in some cases extending our earlier work. The questions relate to Ramsey theory, uniform spaces and tournaments.     

Cliques in Steiner systems

A partial Steiner (k,l)-system is a k-uniform hypergraph with the property that every l-element subset of V is contained in at most one edge of . In this paper we show that for given k,l and t there exists a partial Steiner (k,l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of this note, we establish asymptotic lower and upper bounds on the size of such cliques with respect to the order of Steiner systems. Research of the second author partially supported by NSERC grant OGP0025112.     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

Ramsey Partial Orders from Acyclic Graphs

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that the class of acyclic graphs has the Ramsey property and uses the partite construction.     

Binding abilities of copper to phospholipids and transport of oxalate

Monatshefte für Chemie - Chemical Monthly - Cu(II) creates complexes with dipalmitoylphosphatidylcholine (lecithin), which are detectable using electrospray ionization mass spectrometry....     

Crystal structures of lanthanide(III) complexes with cyclen derivative bearing three acetate and one methylphosphonate pendants

A series of lanthanide(III) complexes formulated as M[Ln(Hdo3ap)].xH(2)O (M = Li or H and Ln = Tb, Dy, Er, Lu, and Y) with the monophosphonate analogue of H(4)dota, 1,4,7,10-tetraazacyclododecane-1,4,7-triacetic-10-methylphosphonic acid (H(5)do3ap), was prepared in the solid state and studied using X-ray crystallography. All of the structures show that the (Hdo3ap)(4-) anion is octadentate coordinated to a lanthanide(III) ion similarly to the other H(4)dota-like ligands, i.e., forming O(4) and N(4) planes that are parallel and have mutual angle smaller than 3 degrees . The lanthanide(III) ions lie between these planes, closer to the O(4) base than to the N(4) plane. All of the structures present the lanthanide(III) complexes in their twisted-square-antiprismatic (TSA) configuration. Twist angles of the pendants vary in the range between -24 and -30 degrees, and for each complex, they lie in a very narrow region of 1 degree. The coordinated phosphonate oxygen is located slightly above (0.02-0.19 Angstroms) the O(3) plane formed with the coordinated acetates. A water molecule was found to be coordinated only in the terbium(III) and neodymium(III) complexes. The bond distance Tb-O(w) is unusually long (2.678 Angstroms). The O-Ln-O angles decrease from 140 degrees [Nd(III)] to 121 degrees [Lu(III)], thus confirming the increasing steric crowding around the water binding site. A comparison of a number of structures of Ln(III) complexes with DOTA-like ligands shows that the TSA arrangement is flexible. On the other hand, the SA arrangement is rigid, and the derived structural parameters are almost identical for different ligands and lanthanide(III) ions.     

Complexity of representation of graphs by set systems

Let $\text{F}$ be a family of subsets of S and let G be a graph with vertex set $\text{V={x}{}_{\mathrm{A}}\text{|A ∈}\text{F}\text{}}$ such that: (x_A, x_B) is an edge iff $\text{A?B≠}\text{0}\text{/}$. The family $\text{F}$ is called a set representation of the graph G.It is proved that the problem of finding minimum k such that G can be represented by a family of sets of cardinality at most k is NP-complete. Moreover, it is NP-complete to decide whether a graph can be represented by a family of distinct 3-element sets.The set representations of random graphs are also considered.     

The structure of Heesch groups and its relation to material property tensors

The magnetic crystal point groups (Heesch groups) are classified according to their structure with respect to the three inversion operations: space, time, and total inversion. Accordingly the tensors are classified by the irreducible representations of the full inversion group. The groups and tensors are considered under the action of the elements A_i of the group of automorphisms of the full inversion group. The following correspondence theorem is proved: The matrix form of the tensor representation T of the group G coincides with the matrix form of the representation A_iT of the group A_iG. The theorem gives a clear explanation of the so-called “magic numbers” and provides a suitable short cut for the calculation and tabulation of material property tensors.