Unexpected behaviour of crossing sequences

The nth crossing number of a graph G, denoted ncr(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which ₀cr(G)=a, ₁cr(G)=b, and ₂cr(G)=0. This provides support for a conjecture of Archdeacon et al. and resolves a problem of Salazar.     

Infinite families of crossing‐critical graphs with prescribed average degree and crossing number

?iráň constructed infinite families of k‐crossing‐critical graphs for every k?3 and Kochol constructed such families of simple graphs for every k?2. Richter and Thomassen argued that, for any given k?1 and r?6, there are only finitely many simple k‐crossing‐critical graphs with minimum degree r. Salazar observed that the same argument implies such a conclusion for simple k‐crossing‐critical graphs of prescribed average degree r>6. He established the existence of infinite families of simple k‐crossing‐critical graphs with any prescribed rational average degree r∈[4, 6) for infinitely many k and asked about their existence for r∈(3, 4). The question was partially settled by Pinontoan and Richter, who answered it positively for $r\in(3\frac{1}{2},4)$. The present contribution uses two new constructions of crossing‐critical simple graphs along with the one developed by Pinontoan and Richter to unify these results and to answer Salazar's question by the following statement: there exist infinite families of simple k‐crossing‐critical graphs with any prescribed average degree r∈(3, 6), for any k greater than some lower bound N_r. Moreover, a universal lower bound N_I on k applies for rational numbers in any closed interval I?(3, 6). © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 139–162, 2010     

Convexity and all‐time C∞‐regularity of the interface in flame propagation

We consider the following one‐phase free boundary problem: Find (u, Ω) such that Ω = {u > 0} and with Q_T = ?ⁿ × (0, T). Under the condition that Ω_o is convex and log u_o is concave, we show that the convexity of Ω(t) and the concavity of log u(·, t) are preserved under the flow for 0 ≤ t ≤ T as long as ?Ω(t) and u on Ω(t) are smooth. As a consequence, we show the existence of a smooth‐up‐to‐the‐interface solution, on 0 < t < T_c, with T_c denoting the extinction time of Ω(t). We also provide a new proof of a short‐time existence with C^2,α initial data on the general domain. © 2002 John Wiley & Sons, Inc.     

Two‐coloring random hypergraphs

A 2‐coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H=H(k, n, p) be a random k‐uniform hypergraph on a vertex set V of cardinality n, where each k‐subset of V is an edge of H with probability p, independently of all other k‐subsets. Let $ m = p{{n}\choose{k}}$ denote the expected number of edges in H. Let us say that a sequence of events ?_n holds with high probability (w.h.p.) if lim_n→∞Pr[?_n]=1. It is easy to show that if m=c2^kn then w.h.p H is not 2‐colorable for c>ln 2/2. We prove that there exists a constant c>0 such that if m=(c2^k/k)n, then w.h.p H is 2‐colorable. © 2002 Wiley Periodicals, Inc. Random Struct. Alg. 20: 249–259, 2002     

Two maps on one surface

Two embeddings of a graph in a surface S are said to be “equivalent” if they are identical under an homeomorphism of S that is orientation‐preserving for orientable S. Two graphs cellularly embedded simultaneously in S are said to be “jointly embedded” if the only points of intersection involve an edge of one graph transversally crossing an edge of the other. The problem is to find equivalent embeddings of the two graphs that minimize the number of these edge‐crossings; this minimum we call the “joint crossing number” of the two graphs. In this paper, we calculate the exact value for the joint crossing number for two graphs simultaneously embedded in the projective plane. Furthermore, we give upper and lower bounds when the surface is the torus, which in many cases give an exact answer. In particular, we give a construction for re‐embedding (equivalently) the graphs in the torus so that the number of crossings is best possible up to a constant factor. Finally, we show that if one of the embeddings is replaced by its “mirror image,” then the joint crossing number can decrease, but not by more than 6.066%. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 198–216, 2001     

Crossing numbers of sequences of graphs II: Planar tiles

We describe a method of creating an infinite family of crossing‐critical graphs from a single small planar map, the tile, by gluing together many copies of the tile together in a circular fashion. This method yields all known infinite families of k‐crossing‐critical graphs. Furthermore, the method yields new infinite families, which extend from (4,6) to (3.5,6) the interval of rationals r for which there is, for some k, an infinite sequence of k‐crossing‐critical graphs all having average degree r. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 332–341, 2003     

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.     

On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set

Let 𝒯(n,?r;?W _n?1) be the set of all n-vertex weighted trees with r vertices of degree 2 and fixed positive weight set W _n?1, 𝒫(n,?γ;?W _n?1) the set of all n-vertex weighted trees with q pendants and fixed positive weight set W _n?1, where W _n?1?=?{w ₁,?w ₂,?…?,?w _n?1} with w ₁???w ₂???···???w _n?1?>?0. In this article, we first identify the unique weighted tree in 𝒯(n,?r;?W _n?1) with the largest adjacency spectral radius. Then we characterize the unique weighted trees with the largest adjacency spectral radius in 𝒫(n,?γ;?W _n?1).     

A Hard-Core Model on a Cayley Tree: An Example of a Loss Network

The paper is about a nearest-neighbor hard-core model, with fugacity λ>0, on a homogeneous Cayley tree of order k(with k+1 neighbors). This model arises as as a simple example of a loss network with a nearest-neighbor exclusion. We focus on Gibbs measures for the hard core model, in particular on ‘splitting’ Gibbs measures generating a Markov chain along each path on the tree. In this model, ?λ>0 and k≥1, there exists a unique translation-invariant splitting Gibbs measure μ^*. Define λ_c=1/(k?1)×(k/(k?1)) ^k . Then: (i) for λ≤λ_c, the Gibbs measure is unique (and coincides with the above measure μ^*), (ii) for λ>λ_c, in addition to μ^*, there exist two distinct translation-periodic measures, μ₊and μ_?, taken to each other by the unit space shift. Measures μ₊and μ_?are extreme ?λ>λ_c. We also construct a continuum of distinct, extreme, non-translational-invariant, splitting Gibbs measures. For $\lambda >1/(\sqrt k - 1) \times (\sqrt k /\sqrt k - 1))^k $ , measure μ^*is not extreme (this result can be improved). Finally, we consider a model with two fugacities, λ_eand λ_o, for even and odd sites. We discuss open problems and state several related conjectures.     

A descent method for submodular function minimization

We show a descent method for submodular function minimization based on an oracle for membership in base polyhedra. We assume that for any submodular function f: ?→R on a distributive lattice ?⊆2 ^V with ?,V∈? and f(?)=0 and for any vector x∈R ^V where V is a finite nonempty set, the membership oracle answers whether x belongs to the base polyhedron associated with f and that if the answer is NO, it also gives us a set Z∈? such that x(Z)>f(Z). Given a submodular function f, by invoking the membership oracle O(|V|²) times, the descent method finds a sequence of subsets Z ₁,Z ₂,···,Z _k of V such that f(Z ₁)>f(Z ₂)>···>f(Z _k )=min{f(Y) | Y∈?}, where k is O(|V|²). The method furnishes an alternative framework for submodular function minimization if combined with possible efficient membership algorithms. Received: September 9, 2001 / Accepted: October 15, 2001?Published online December 6, 2001     

Recursive constructions for triangulations

Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2) non‐isomorphic face 2‐colourable triangulations of K_n and K_n,n,n in orientable and non‐orientable surfaces for values of n lying in certain residue classes and for appropriate constants a. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 87–107, 2002     

The asymptotic number of labeled connected graphs with a given number of vertices and edges

Let c(n, q) be the number of connected labeled graphs with n vertices and q ≤ N = (2n ) edges. Let x = q/n and k = q ? n. We determine functions w_k ? 1. a(x) and φ(x) such that c(n, q) ? w_k(q^N)eⁿφ(x)+a(x) uniformly for all n and q ≥ n. If ? > 0 is fixed, n→ ∞ and 4q > (1 + ?)n log n, this formula simplifies to c(n, q) ? (N^q) exp(–ne^?2q/n). on the other hand, if k = o(n^1/2), this formula simplifies to c(n, n + k) ? 1/2 w_k (3/π)^1/2 (e/12k)^k/2nⁿ?^(3k?1)/2.     

Subrecursive degrees and fragments of Peano Arithmetic

Let T ₀?T ₁ denote that each computable function, which is provable total in the first order theory T ₀, is also provable total in the first order theory T ₁. Te relation ? induces a degree structure on the sound finite Π₂ extensions of EA (Elementary Arithmetic). This paper is devoted to the study of this structure. However we do not study the structure directly. Rather we define an isomorphic subrecursive degree structure <≤,?>, and then we study <≤,?> by ubrecursive and computability-theoretic means. Furthermore, we introduce and investigate some operators on the degrees of <≤,?>. These operators corresponds to inferencerules in formal arithmetic. One operator corresponds to the Σ₁ collection rule. Another operator corresponds to the Σ₁ induction rule.     

The cover time of the giant component of a random graph

We study the cover time of a random walk on the largest component of the random graph G_n,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(lnn). In particular, we show that the cover time is not monotone for c = Θ(lnn). We also determine the cover time of the k‐cores, k ≥ 2. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

From regular boundary graphs to antipodal distance-regular graphs

Let Γ be a regular graph with n vertices, diameter D, and d + 1 different eigenvalues λ > λ₁ > ··· > λ_d. In a previous paper, the authors showed that if P(λ) > n − 1, then D ≤ d − 1, where P is the polynomial of degree d − 1 which takes alternating values ± 1 at λ₁, …, λ_d. The graphs satisfying P(λ) = n − 1, called boundary graphs, have shown to deserve some attention because of their rich structure. This paper is devoted to the study of this case and, as a main result, it is shown that those extremal (D = d) boundary graphs where each vertex have maximum eccentricity are, in fact, 2-antipodal distance-regular graphs. The study is carried out by using a new sequence of orthogonal polynomials, whose special properties are shown to be induced by their intrinsic symmetry. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 123–140, 1998     

Crossing numbers of graph embedding pairs on closed surfaces

We shall prove that any two graphs G₁ and G₂ can be embedded together on a closed surface of genus g with at most 4g · β(G₁) · β(G₂) crossing points on their edges if they are embeddable on the surface, where β(G) stands for the Betti number of G, and show several observations on crossings of graph embedding pairs. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 8–23, 2001     

Randomly coloring graphs with lower bounds on girth and maximum degree

We consider the problem of generating a random q‐coloring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if the maximum degree Δ > c₁ln n and the girth g > c₂ln Δ (n = |V|) for sufficiently large c₁, c₂, then this chain mixes rapidly provided q/Δ > β, where β ≈ 1.763 is the root of β = e^1/β. For this class of graphs, this beats the 11Δ/6 bound of Vigoda 14 for general graphs. We extend the result to random graphs. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 167–179, 2003     

Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.     

Existential closure of block intersection graphs of infinite designs having finite block size and index

In this article we study the n‐existential closure property of the block intersection graphs of infinite t‐(v, k, λ) designs for which the block size k and the index λ are both finite. We show that such block intersection graphs are 2‐e.c. when 2?t?k ? 1. When λ = 1 and 2?t?k, then a necessary and sufficient condition on n for the block intersection graph to be n‐e.c. is that n?min{t, ?(k ? 1)/(t ? 1)? + 1}. If λ?2 then we show that the block intersection graph is not n‐e.c. for any n?min{t + 1, ?k/t? + 1}, and that for 3?n?min{t, ?k/t?} the block intersection graph is potentially but not necessarily n‐e.c. The cases t = 1 and t = k are also discussed. © 2011 Wiley Periodicals, Inc. J Combin Designs 19: 85–94, 2011