Coloring of distance graphs with intervals as distance sets

Let D be a set of positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z in which two vertices x,y are adjacent if and only if |x−y|D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z,D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form D_m,[k,k^′]={1,2,…,m}−{k,k+1,…,k^′}, where m, k, and k^′ are natural numbers with m≥k^′≥k. In particular, we completely determine the chromatic number of G(Z,D_m,[2,k^′]) for arbitrary m, and k^′.     

Integral distance graphs

Suppose D is a subset of all positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x − y| ≡ D. This paper studies the chromatic number χ(Z, D) of G(Z, D). In particular, we prove that χ(Z, D) ≤ |D| + 1 when |D| is finite. Exact values of χ(G, D) are also determined for some D with |D| = 3. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 287–294, 1997     

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     

Circular choosability of graphs

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) χ_{c, l}(G) of a graph G and prove that they are equivalent. Then we prove that for any graph G, χ_{c, l}(G) ≥ χ_l(G) ? 1. Examples are given to show that this bound is sharp in the sense that for any ? 0, there is a graph G with χ_{c, l}(G) > χ_l(G) ? 1 + ?. It is also proved that k‐degenerate graphs G have χ_{c, l}(G) ≤ 2k. This bound is also sharp: for each ? < 0, there is a k‐degenerate graph G with χ_{c, l}(G) ≥ 2k ? ?. This shows that χ_{c, l}(G) could be arbitrarily larger than χ_l(G). Finally we prove that if G has maximum degree k, then χ_{c, l}(G) ≤ k + 1. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 210–218, 2005     

On number system constructions

We investigate various number system constructions. After summarizing earlier results we prove that for a given lattice Λ and expansive matrix M: Λ → Λ if ρ(M ⁻¹) < 1/2 then there always exists a suitable digit set D for which (Λ, M, D) is a number system. Here ρ means the spectral radius of M ⁻¹. We shall prove further that if the polynomial f(x) = c ₀ + c ₁ x + ··· + c _k x ^k ∈ Z[x], c _k = 1 satisfies the condition |c ₀| > 2 Σ _i=1 ^k |c _i | then there is a suitable digit set D for which (Z ^k , M, D) is a number system, where M is the companion matrix of f(x). The research was supported by OTKA-T043657 and Bolyai Fellowship Committee.     

Inequalities for the first‐fit chromatic number

The First‐Fit (or Grundy) chromatic number of G, written as χ_FF(G), is defined as the maximum number of classes in an ordered partition of V(G) into independent sets so that each vertex has a neighbor in each set earlier than its own. The well‐known Nordhaus‐‐Gaddum inequality states that the sum of the ordinary chromatic numbers of an n‐vertex graph and its complement is at most n + 1. Zaker suggested finding the analogous inequality for the First‐Fit chromatic number. We show for n ≥ 10 that ?(5n + 2)/4? is an upper bound, and this is sharp. We extend the problem for multicolorings as well and prove asymptotic results for infinitely many cases. We also show that the smallest order of C₄‐free bipartite graphs with χ_FF(G) = k is asymptotically 2k² (the upper bound answers a problem of Zaker [9]). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 75–88, 2008     

Hadwiger number and chromatic number for near regular degree sequences

We consider a problem related to Hadwiger's Conjecture. Let D=(d₁, d₂, …, d_n) be a graphic sequence with 0?d₁?d₂?···?d_n?n?1. Any simple graph G with D its degree sequence is called a realization of D. Let R[D] denote the set of all realizations of D. Define h(D)=max{h(G): G∈R[D]} and χ(D)=max{χ(G): G∈R[D]}, where h(G) and χ(G) are Hadwiger number and chromatic number of a graph G, respectively. Hadwiger's Conjecture implies that h(D)?χ(D). In this paper, we establish the above inequality for near regular degree sequences. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 175–183, 2010     

On a conjecture by Plummer and Toft

The cyclic chromatic number χ_c(G) of a 2‐connected plane graph G is the minimum number of colors in an assigment of colors to the vertices of G such that, for every face‐bounding cycle f of G, the vertices of f have different colors. Plummer and Toft proved that, for a 3‐connected plane graph G, under the assumption Δ*(G) ≥ 42, where Δ*(G) is the size of a largest face of G, it holds that χ_c(G) ≤ Δ*(G) + 4. They conjectured that, if G is a 3‐connected plane graph, then χ_c>(G) ≤ Δ*(G) + 2. In the article the conjecture is proved for Δ*(G) ≥ 24. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 177–189, 1999     

Some results on the achromatic number

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ≤ m. We show that the problem of determining the achromatic number of a tree is NP-hard. We further prove that almost all trees T satisfy ψ (T) = q(m), where m is the number of edges in T. Lastly, for fixed d and ϵ > 0, we show that there is an integer N₀ = N₀(d, ϵ) such that if G is a graph with maximum degree at most d, and m ≥ N₀ edges, then (1 - ϵ)q(m) ≤ ψ (G) ≤ q(m). © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 129–136, 1997     

Multiple vertex coverings by specified induced subgraphs

Given graphs H₁,…, H_k, let f(H₁,…, H_k) be the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove constructively that f(H₁, H₂) ≤ 2(n(H₁) + n(H₂) − 2); equality holds when H₁ = H ₂ = K_n. We prove that f(H₁, K _n) = n + 2√δ(H₁)n + O(1) as n → ∞. We also determine f(K_{1, m −1}, K _n) exactly. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 180–190, 2000     

A wavelike functional equation of Pexider type

Summary. Let (G, +) and (H, +) be abelian groups such that the equation 2u = v 2u = v is solvable in both G and H. It is shown that if f₁, f₂, f₃, f₄, : G ×G ? H f_1, f_2, f_3, f_4, : G \times G \longrightarrow H satisfy the functional equation f₁(x + t, y + s) + f₂(x - t, y - s) = f₃(x + s, y - t) + f₄(x - s, y + t) for all x, y, s, t ? G x, y, s, t \in G , then f₁, f₂, f₃, and f₄ are given by f₁ = w + h, f₂ = w - h, f₃ = w + k, f₄ = w - k where w : G ×G ? H w : G \times G \longrightarrow H is an arbitrary solution of f (x + t, y + s) + f (x - t, y - s) = f (x + s, y - t) + f (x - s, y + t) for all x, y, s, t ? G x, y, s, t \in G , and h, k : G ×G ? H h, k : G \times G \longrightarrow H are arbitrary solutions of D_y,t³g(x,y) = 0 \Delta_{y,t}^{3}g(x,y) = 0 and D_x,t³g(x,y) = 0 \Delta_{x,t}^{3}g(x,y) = 0 for all x, y, s, t ? G x, y, s, t \in G .     

Extremal graphs of diameter two and given maximum degree,embeddable in a fixed surface

It is known that for each d there exists a graph of diameter two and maximum degree d which has at least ⌈(d/2)⌉ ⌈(d + 2)/2⌉ vertices. In contrast with this, we prove that for every surface S there is a constant d_s such that each graph of diameter two and maximum degree d ≥ d_s, which is embeddable in S, has at most ⌊(3/2)d⌋ + 1 vertices. Moreover, this upper bound is best possible, and we show that extremal graphs can be found among surface triangulations. © 1997 John Wiley & Sons, Inc.     

On the complexity of the circular chromatic number

Circular chromatic number, χ_c is a natural generalization of chromatic number. It is known that it is NP ‐hard to determine whether or not an arbitrary graph G satisfies χ(G)=χ_c(G). In this paper we prove that this problem is NP ‐hard even if the chromatic number of the graph is known. This answers a question of Xuding Zhu. Also we prove that for all positive integers k ≥ 2 and n ≥ 3, for a given graph G with χ(G) = n, it is NP ‐complete to verify if . © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 226–230, 2004     

Boundary effects on convergence rates for Tikhonov regularization

We consider the Tikhonov regularizer f_λ of a smooth function f ε H^2m[0, 1], defined as the solution (see [1]) to We prove that if f^(j)(0) = f^(j)(1) = 0, J = m, …, k < 2m − 1, then ¦f − f_λ¦_j² Rλ^{(2k − 2j + 3)/2m}, J = 0, …, m. A detailed analysis is given of the effect of the boundary on convergence rates.     

Minimum degree thresholds for bipartite graph tiling

Given a bipartite graph H and a positive integer n such that v(H) divides 2n, we define the minimum degree threshold for bipartite H‐tiling, δ₂(n, H), as the smallest integer k such that every bipartite graph G with n vertices in each partition and minimum degree δ(G)≥k contains a spanning subgraph consisting of vertex‐disjoint copies of H. Zhao, Hladký‐Schacht, Czygrinow‐DeBiasio determined δ₂(n, K_{s, t}) exactly for all s?t and suffi‐ciently large n. In this article we determine δ₂(n, H), up to an additive constant, for all bipartite H and sufficiently large n. Additionally, we give a corresponding minimum degree threshold to guarantee that G has an H‐tiling missing only a constant number of vertices. Our δ₂(n, H) depends on either the chromatic number χ(H) or the critical chromatic number χ_cr(H), while the threshold for the almost perfect tiling only depends on χ_cr(H). These results can be viewed as bipartite analogs to the results of Kuhn and Osthus [Combinatorica 29 (2009), 65–107] and of Shokoufandeh and Zhao [Rand Struc Alg 23 (2003), 180–205]. © 2011 Wiley Periodicals, Inc. J Graph Theory     

The circular chromatic number of series‐parallel graphs with large girth

It was proved by Hell and Zhu that, if G is a series‐parallel graph of girth at least 2⌊(3k − 1)/2⌋, then χ_c(G) ≤ 4k/(2k − 1). In this article, we prove that the girth requirement is sharp, i.e., for any k ≥ 2, there is a series‐parallel graph G of girth 2⌊(3k − 1)/2⌋ − 1 such that χ_c(G) > 4k/(2k − 1). © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 185–198, 2000     

Homotopy Types of Stabilizers and Orbits of Morse Functions on Surfaces

Let M be a smooth compact surface, orientable or not, with boundary or without it, P either the real line ℝ ¹ or the circle S ¹, and D(M) the group of diffeomorphisms of M acting on C^∞(M, P) by the rule h⋅ f = f ∘ h ⁻¹ for h ∊ D(M) and f ∊ C^∞ (M,P). Let f: M → P be an arbitrary Morse mapping, Σ _f the set of critical points of f, D(M,Σ _f ) the subgroup of D(M) preserving Σ _f , and S(f), S (f,Σ _f ), O(f), and O(f,Σ _f ) the stabilizers and the orbits of f with respect to D(M) and D(M,Σ _f ). In fact S(f) = S(f,Σ _f ).In this paper we calculate the homotopy types of S(f), O(f) and O(f,Σ _f ). It is proved that except for few cases the connected components of S(f) and O(f,Σ _f ) are contractible, π _k O(f) = π _k M for k ≥ 3, π₂ O(f) = 0, and π₁ O(f) is an extension of π₁ D(M) ⊕ Z ^k (for some k ≥ 0) with a (finite) subgroup of the group of automorphisms of the Kronrod-Reeb graph of f.We also generalize the methods of F. Sergeraert to give conditions for a finite codimension orbit of a tame smooth action of a tame Lie group on a tame Fréchet manifold to be a tame Fréchet manifold itself. In particular, we obtain that O(f) and O(f, Σ _f ) are tame Fréchet manifolds. Communicated by Peter Michor Vienna Mathematics Subject Classifications (2000): 37C05, 57S05, 57R45.     

A note on the bichromatic numbers of graphs

For a pair of integers k, l≥0, a graph G is (k, l)‐colorable if its vertices can be partitioned into at most k independent sets and at most l cliques. The bichromatic number χ^b(G) of G is the least integer r such that for all k, l with k+l=r, G is (k, l)‐colorable. The concept of bichromatic numbers simultaneously generalizes the chromatic number χ(G) and the clique covering number θ(G), and is important in studying the speed of hereditary properties and edit distances of graphs. It is easy to see that for every graph G the bichromatic number χ^b(G) is bounded above by χ(G)+θ(G)?1. In this article, we characterize all graphs G for which the upper bound is attained, i.e., χ^b(G)=χ(G)+θ(G)?1. It turns out that all these graphs are cographs and in fact they are the critical graphs with respect to the (k, l)‐colorability of cographs. More specifically, we show that a cograph H is not (k, l)‐colorable if and only if H contains an induced subgraph G with χ(G)=k+1, θ(G)=l+1 and χ^b(G)=k+l+1. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 263–269, 2010     

Characterization and Transformation of Invariants

We consider difference equations of order k _n+k ≥ 2 of the form: y_n+k = f(yn,…,yn+k-1), n= 0,1,2,… where f: D ^k → D is a continuous function, and D?R. We develop a necessary and sufficient condition for the existence of a symmetric invariant I(x ₁,…,x_k ) ∈C^∞[D^k,D]. This condition will be used to construct invariants for linear and rational difference equations. Also, we investigate the transformation of invariants under invertible maps. We generalize and extend several results that have been obtained recently.