On the number of list-colorings

Given a list of boxes L for a graph G (each vertex is assigned a finite set of colors that we call a box), we denote by f(G, L) the number of L-colorings of G (each vertex must be colored wiht a color of its box). In the case where all the boxes are identical and of size k, f(G, L) = p(G, k), where P=G, k) is the chromatic polynominal of G. We denote by F(G, k) the minimum of f(G, L) over all the lists of boxes such that each box has size at least k. It is clear that F(G, k) ≤ P(G, k) for all G, k, and we will see in the introduction some examples of graphs such that F(G, k) < P(G, k) for some k. However, we will show, in answer to a problem proposed by A. Kostochka and A. Sidorenko (Fourth Czechoslovak Symposium on Combinatorics, Prachatice, Jin, 1990), that for all G, F(G, k) = P(G, k) for all k sufficiently large. It will follow in particular that F(G, k) is not given by a polynominal in k for all G. The proof is based on the analysis of an algorithm for computing f(G, L) analogous to the classical one for computing P(G, k).     

Subgraph‐avoiding coloring of graphs

Given a “forbidden graph” F and an integer k, an F‐avoiding k‐coloring of a graph G is a k‐coloring of the vertices of G such that no maximal F‐free subgraph of G is monochromatic. The F‐avoiding chromatic number ac_F(G) is the smallest integer k such that G is F‐avoiding k‐colorable. In this paper, we will give a complete answer to the following question: for which graph F, does there exist a constant C, depending only on F, such that ac_F(G) ? C for any graph G? For those graphs F with unbounded avoiding chromatic number, upper bounds for ac_F(G) in terms of various invariants of G are also given. Particularly, we prove that ${{ac}}_{{{F}}}({{G}})\le {{2}}\lceil\sqrt{{{n}}}\rceil+{{1}}Given a “forbidden graph” F and an integer k, an F‐avoiding k‐coloring of a graph G is a k‐coloring of the vertices of G such that no maximal F‐free subgraph of G is monochromatic. The F‐avoiding chromatic number ac_F(G) is the smallest integer k such that G is F‐avoiding k‐colorable. In this paper, we will give a complete answer to the following question: for which graph F, does there exist a constant C, depending only on F, such that ac_F(G) ? C for any graph G? For those graphs F with unbounded avoiding chromatic number, upper bounds for ac_F(G) in terms of various invariants of G are also given. Particularly, we prove that ${{ac}}_{{{F}}}({{G}})\le {{2}}\lceil\sqrt{{{n}}}\rceil+{{1}}$, where n is the order of G and F is not K_k or $\overline{{{K}}_{{{k}}}}$. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 300–310, 2010     

The characterization of zero-sum (mod 2) bipartite Ramsey numbers

Let G be a bipartite graph, with k|e(G). The zero-sum bipartite Ramsey number B(G, Z_k) is the smallest integer t such that in every Z_k-coloring of the edges of K_t,t, there is a zero-sum mod k copy of G in K_t,t. In this article we give the first proof that determines B(G, Z₂) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G, Z₂) can be deduced: Let G be a (not necessarily connected) bipartite graph, which can be embedded in K_n,n, and let F be a field. A function f : E(K_n,n) → F is called G-stable if every copy of G in K_n,n has the same weight (the weight of a copy is the sum of the values of f on its edges). The set of all G-stable functions, denoted by U(G, K_n,n, F) is a linear space, which is called the K_n,n uniformity space of G over F. We determine U(G, K_n,n, F) and its dimension, for all G, n and F. Utilizing this result in the case F = Z₂, we can compute B(G, Z₂), for all bipartite graphs G. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 151–166, 1998     

A New Class of Generalized Thompson's Groups and Their Normal Subgroups

For a given group G and a homomorphism ?: G → G × G, we construct groups ?_?(G), 𝒯_?(G), and 𝒱_?(G) that blend Thompson's groups F, T, and V with G, respectively. Furthermore, we describe the lattice of normal subgroups of the groups ?_Δ(G), where Δ: G → G × G is the diagonal homomorphism, Δ(g) = (g, g).     

Bounded factorization property for Fréchet spaces

An operator T ∈ L(E, F) factors over G if T = RS for some S ∈ L(E, G) and R ∈ L(G, F); the set of such operators is denoted by L^G(E, F). A triple (E, G, F) satisfies bounded factorization property (shortly, (E, G, F) ∈ ???) if L^G(E, F) ? LB(E, F), where LB(E, F) is the set of all bounded linear operators from E to F. The relationship (E, G, F) ∈ ??? is characterized in the spirit of Vogt's characterisation of the relationship L(E, F) = LB(E, F) [23]. For triples of K?othe spaces the property ??? is characterized in terms of their K?othe matrices. As an application we prove that in certain cases the relations L(E, G₁) = LB(E, G₁) and L(G₂, F) = LB(G₂, F) imply (E, G, F) ∈ ??? where G is a tensor product of G₁ and G₂.     

Relatively Free Nilpotent Torsion-Free Groups and Their Lie Algebras

Let K be a field of characteristic zero. For a torsion-free finitely generated nilpotent group G, we naturally associate four finite dimensional nilpotent Lie algebras over K, ? _K (G), grad^(?)(? _K (G)), grad^(g)(exp ? _K (G)), and L _K (G). Let 𝔗 _c be a torsion-free variety of nilpotent groups of class at most c. For a positive integer n, with n ≥ 2, let F _n (𝔗 _c ) be the relatively free group of rank n in 𝔗 _c . We prove that ? _K (F _n (𝔗 _c )) is relatively free in some variety of nilpotent Lie algebras, and ? _K (F _n (𝔗 _c )) ? L _K (F _n (𝔗 _c )) ? grad^(?)(? _K (F _n (𝔗 _c ))) ? grad^(g)(exp ? _K (F _n (𝔗 _c ))) as Lie algebras in a natural way. Furthermore, F _n (𝔗 _c ) is a Magnus nilpotent group. Let G ₁ and G ₂ be torsion-free finitely generated nilpotent groups which are quasi-isometric. We prove that if G ₁ and G ₂ are relatively free of finite rank, then they are isomorphic. Let L be a relatively free nilpotent Lie algebra over ? of finite rank freely generated by a set X. Give on L the structure of a group R, say, by means of the Baker–Campbell–Hausdorff formula, and let H be the subgroup of R generated by the set X. We show that H is relatively free in some variety of nilpotent groups; freely generated by the set X, H is Magnus and L ? ?_?(H) ? L _?(H) as Lie algebras. For relatively free residually torsion-free nilpotent groups, we prove that ? _K and L _K are isomorphic as Lie algebras. We also give an example of a finitely generated Magnus nilpotent group G, not relatively free, such that ?_?(G) is not isomorphic to L _?(G) as Lie algebras.     

Edge‐face chromatic number and edge chromatic number of simple plane graphs

Given a simple plane graph G, an edge‐face k‐coloring of G is a function ? : E(G) ∪ F(G) → {1,…,k} such that, for any two adjacent or incident elements a, b ∈ E(G) ∪ F(G), ?(a) ≠ ?(b). Let χ_e(G), χ_ef(G), and Δ(G) denote the edge chromatic number, the edge‐face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that χ_ef(G) = χ_e(G) = Δ(G) for any 2‐connected simple plane graph G with Δ (G) ≥ 24. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Tension polynomials of graphs

The tension polynomial F_G(k) of a graph G, evaluating the number of nowhere‐zero ?_k‐tensions in G, is the nontrivial divisor of the chromatic polynomial χ_G(k) of G, in that χ_G(k) = k^c(G)F_G(k), where c(G) denotes the number of components of G. We introduce the integral tension polynomial I_G(k), which evaluates the number of nowhere‐zero integral tensions in G with absolute values smaller than k. We show that 2^r(G)F_G(k)≥I_G(k)≥ (r(G)+1)F_G(k), where r(G)=|V(G)|?c(G), and, for every k>1, F_G(k+1)≥ F_G(k)˙k / (k?1) and I_G(k+1)≥I_G(k)˙k/(k?1). © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 137–146, 2002     

An equivalence between varieties of cyclic Post algebras and varieties generated by a finite field

In this paper we give a term equivalence between the simple k-cyclic Post algebra of order p, L _p,k, and the finite field F(p ^k) with constants F(p). By using Lagrange polynomials, we give an explicit procedure to obtain an interpretation Φ₁ of the variety V(L _p,k) generated by L _p,k into the variety V(F(p ^k)) generated by F(p ^k) and an interpretation Φ₂ of V(F(p ^k)) into V(L _p,k) such that Φ₂Φ₁(B) = B for every B ε V(L _p,k) and Φ₁Φ₂(R) = R for every R ε V(F(p ^k)).     

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

Hall parameters of complete and complete bipartite graphs

Given a graph G, for each υ ∈V(G) let L(υ) be a list assignment to G. The well‐known choice number c(G) is the least integer j such that if |L(υ)| ≥j for all υ ∈V(G), then G has a proper vertex colouring ? with ?(υ) ∈ L (υ) (?υ ∈V(G)). The Hall number h(G) is like the choice number, except that an extra non‐triviality condition, called Hall's condition, has to be satisfied by the list assignment. The edge‐analogue of the Hall number is called the Hall index, h′(G), and the total analogue is called the total Hall number, h″(G), of G. If the stock of colours from which L(υ) is selected is restricted to a set of size k, then the analogous numbers are called k‐restricted, or restricted, Hall parameters, and are denoted by h_k(G), h′_k(G) and h″_k(G). Our main object in this article is to determine, or closely bound, h′(K), h″(K_n), h′(K_m,n) and h′_k(K_m,n). We also answer some hitherto unresolved questions about Hall parameters. We show in particular that there are examples of graphs G with h′(G)?h′(G ? e)>1. We show that there are examples of graphs G and induced subgraphs H with h_k(G)<h_k(H) [this phenomenon cannot occur with unrestricted Hall numbers]. We also give an example of a graph G and an integer k such that h_k(G)<χ(G)<h(G). © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 208–237, 2002     

Odd‐angulated graphs and cancelling factors in box products

Under what conditions is it true that if there is a graph homomorphism G □ H → G □ T, then there is a graph homomorphism H→ T? Let G be a connected graph of odd girth 2k + 1. We say that G is (2k + 1)‐angulated if every two vertices of G are joined by a path each of whose edges lies on some (2k + 1)‐cycle. We call G strongly (2k + 1)‐angulated if every two vertices are connected by a sequence of (2k + 1)‐cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2k + 1)‐angulated, H is any graph, S, T are graphs with odd girth at least 2k + 1, and ?: G□ H→S□T is a graph homomorphism, then either ? maps G□{h} to S□{t_h} for all h∈V(H) where t_h∈V(T) depends on h; or ? maps G□{h} to {s_h}□ T for all h∈V(H) where s_h∈V(S) depends on h. This theorem allows us to prove several sufficient conditions for a cancelation law of a graph homomorphism between two box products with a common factor. We conclude the article with some open questions. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:221‐238, 2008     

Intrinsic metric preserving maps on partially ordered groups

In [11] Pap proved that a surjective mapf from an abelian lattice ordered groupG ₁ onto an abelian Archimedean lattice ordered group G₂ which preserves non-zero intrinsic metricsd ₁, andd ₂ onG ₁ andG ₂, respectively (i.e.d ₁(x,y)=d₁(z, t) implies d₂(f(x)f(y))= d₂(f(z),f(t))) and satisfiesf(0)=0 is a homomorphism and put the question whether that assertion is true in the case that G₂ is a non-Archimedean lattice ordered group. In this paper it is proved that a surjective map from an abelian directedG ₁ onto a directed group G₂ such thatf(0)=0 is a homomorphism if ¦x –y ¦=¦z – t¦ implies ¦f(x) –f(y)¦=¦f(z) –f(t)¦ and it is shown that the answer to the question of Pap is positive.Presented by M. Henriksen.     

K4−‐factor in a graph

Let G be a graph of order 4k and let δ(G) denote the minimum degree of G. Let F be a given connected graph. Suppose that |V(G)| is a multiple of |V(F)|. A spanning subgraph of G is called an F‐factor if its components are all isomorphic to F. In this paper, we prove that if δ(G)≥5/2k, then G contains a K₄^?‐factor (K₄^? is the graph obtained from K₄ by deleting just one edge). The condition on the minimum degree is best possible in a sense. In addition, the proof can be made algorithmic. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 111–128, 2002     

On Some Three-Color Ramsey Numbers

 In this paper we study three-color Ramsey numbers. Let K _i,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G ₁, G ₂ and G ₃, if r(G ₁, G ₂)≥s(G ₃), then r(G ₁, G ₂, G ₃)≥(r(G ₁, G ₂)−1)(χ(G ₃)−1)+s(G ₃), where s(G ₃) is the chromatic surplus of G ₃; (ii) (k+m−2)(n−1)+1≤r(K _1,k , K _1,m , K _n )≤ (k+m−1)(n−1)+1, and if k or m is odd, the second inequality becomes an equality; (iii) for any fixed m≥k≥2, there is a constant c such that r(K _k,m , K _k,m , K _n )≤c(n/logn), and r(C _2m , C _2m , K _n )≤c(n/logn) ^m/(m−1) for sufficiently large n. Received: July 25, 2000 Final version received: July 30, 2002 RID="*" ID="*" Partially supported by RGC, Hong Kong; FRG, Hong Kong Baptist University; and by NSFC, the scientific foundations of education ministry of China, and the foundations of Jiangsu Province Acknowledgments. The authors are grateful to the referee for his valuable comments. AMS 2000 MSC: 05C55     

L（1, 2）-edge-labelings for lattices

For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by kThe λ j,k-number of G is the minimum m such that an m-L(j, k)-edge-labeling is admitted by GIn this article, the L(1, 2)-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λ j,k-numbers of these graphs are obtained.     

Mixed ramsey numbers: Chromatic numbers versus graphs

For positive integers n₁, n₂, …, n_I and graphs G_I+1, G_I+2, …, G_k, 1 ≤ / < k, the mixed Ramsey number _χ(n₁, …, n₁, G_I+1, …, G_k) is define as the least positive integer p such that for each factorization K_p = F₁⊕ … ⊕ F_⊕ F_I+1⊕ … ⊕ F_k, it it follows that χ(F_i) ≥ n_i for some i, 1 ? i ? l, or G_i is a subgraph of F_i for some i, l < i ? k. Formulas are presented for maxed Ramsey numbers in which the graphs G_I+1, G_I+2, …, G_k are connected, and in which k = I+1 and G_I+1 is arbitray.     

0-Minimal Quasi-ideals of Generalized Linear Transformation Semigroups

Abstract

For vector spaces V and W over a field F, L _F (V, W) denotes the set of all linear transformations α : V → W, and for a cardinal number k > 0, let L _F (V, W, k) be the set of all α ∈ L _F (V, W) of rank less than k. For θ ∈ L _F (W, V), let (L _F (V, W, k), θ) denote the semigroup L _F (V, W, k) under the operation ? defined by α ? β = αθβ for all α, β ∈ L _F (V, W, k). In this paper, all 0-minimal quasi-ideals of the semigroup (L _F (V, W, k), θ) are completely characterized. It is also shown from this characterization that every nonzero semigroup (L _F (V, W, k), θ) always has a 0-minimal quasi-ideal.     

Elements of Small Orders in K2F Ⅱ

In "Elements of small orders in K2(F)" (Algebraic K-Theory, Lecture Notes in Math., 966, 1982, 1-6.), the author investigates elements of the form {a, Φn(a)} in the Milnor group K2F of a field F, where Φn(x) is the n-th cyclotomic polynomial. In this paper, these elements are generalized. Applying the explicit formulas of Rosset and Tate for the transfer homomorphism for K2, the author proves some new results on elements of small orders in K2F.     

List Point Arboricity of Dense Graphs

Let G be a simple graph. The point arboricity ρ(G) of G is defined as the minimum number of subsets in a partition of the point set of G so that each subset induces an acyclic subgraph. The list point arboricity ρ _l (G) is the minimum k so that there is an acyclic L-coloring for any list assignment L of G which |L(v)| ≥ k. So ρ(G) ≤ ρ _l (G) for any graph G. Xue and Wu proved that the list point arboricity of bipartite graphs can be arbitrarily large. As an analogue to the well-known theorem of Ohba for list chromatic number, we obtain ρ _l (G + K _n ) = ρ(G + K _n ) for any fixed graph G when n is sufficiently large. As a consequence, if ρ(G) is close enough to half of the number of vertices in G, then ρ _l (G) = ρ(G). Particularly, we determine that , where K _2(n) is the complete n-partite graph with each partite set containing exactly two vertices. We also conjecture that for a graph G with n vertices, if then ρ _l (G) = ρ(G). Research supported by NSFC (No.10601044) and XJEDU2006S05.