Related papers: The ultimate question

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly…

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

We construct a moduli space of four colorings on planar cubic graphs. More precisely, we introduce the notion of weak Hamiltonian, a generalization of Hamiltonian cycles, and relate it to 4-colorings. Weak Hamiltonians have a form of…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

We study the complexity of counting (weighted) planar graph homomorphism problem $\tt{Pl\text{-}GH}(M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$. For matrices with pairwise distinct diagonal values, we…

There doesn't exists a finite planar map with all edges having the same length, and each vertex on exactly 5 edges.

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…

We prove that the trace of a transient branching random walk on a planar hyperbolic Cayley graph has a.s. continuum many ends and no isolated end.

In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…

A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

In 1971, Tutte wrote in an article that "it is tempting to conjecture that every 3-connected bipartite cubic graph is hamiltonian". Motivated by this remark, Horton constructed a counterexample on 96 vertices. In a sequence of articles by…

In the 1960s, Erd\H{o}s and his cooperators initiated the research of the maximum numbers of edges in a graph or a planar graph on $n$ vertices without $k$ edge-disjoint cycles. This problem had been solved for $k\leq4$. As pointed out by…

We discuss an omission in the statement and proof of Fiorini's 1983 theorem on hypohamiltonian snarks and present a version of this theorem which is more general in several ways. Using Fiorini's erroneous result, Steffen showed that…

In this paper, we show that any knot group maps onto at most finitely many knot groups. This gives an affirmative answer to a conjecture of J. Simon. We also bound the diameter of a closed hyperbolic 3-manifold linearly in terms of the…

We prove that the knots and links in the infinite set of $3$-highly twisted $2m$-plats, with $m \geq 2$, are all hyperbolic. This should be compared with a result of Futer-Purcell for $6$-highly twisted diagrams. While their proof uses…

Thomassen conjectured that every triangle-free planar graph on n vertices has exponentially many 3-colorings, and proved that it has at least 2^[n^(1/12)/20000] distinct 3-colorings. We show that it has at least 2^sqrt(n/362) distinct…