Related papers: Augmentation Lemma for Halin Conjecture

A well-known conjecture of Erd\H{o}s and S\'os states that every graph with average degree exceeding $m-1$ contains every tree with $m$ edges as a subgraph. We propose a variant of this conjecture, which states that every graph of maximum…

We prove Jones' famous conjecture for Halin graphs and a somewhat more general class of graphs, too. A based planar graph is a planar one that has a face adjacent to every other face. We confirm Jones' conjecture for based planar graphs.…

Negami's famous planar cover conjecture is equivalent to the statement that a connected graph can be embedded in the projective plane if and only if it has a projective planar cover. In 1999, Hlin\v{e}n\'y proposed extending this conjecture…

We conjecture that the exceptional set in Manin's Conjecture has an explicit geometric description. Our proposal includes the rational point contributions from any generically finite map with larger geometric invariants. We prove that this…

We prove the $\Sigma^1$-conjecture for two families of Artin groups: Artin groups such that there exists a prime number $p$ dividing $\frac{l(e)}{2}$ for every edge $e$ with even label $>2$ and balanced Artin groups. The family of balanced…

In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…

In this paper I verify Manin's conjecture for a class of rational projective toric varieties with a large class of heights other than the usual one that comes from the standard metric on projective space.

Klimo\v{s}ov\'a, Piguet, and Rozho\v{n} conjectured that any graph with minimum degree $k/2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove an asymptotic version of this conjecture for dense…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

The Gyarfas-Sumner conjecture asserts that if H is a tree then every graph with bounded clique number and very large chromatic number contains H as an induced subgraph. This is still open, although it has been proved for a few simple…

A result about spanning forests for graphs yields a short proof of Krebes's theorem concerning embedded tangles in links.

Manin's conjecture predicts an asymptotic formula for the number of rational points of bounded height on a smooth projective variety in terms of its global geometric invariants. The strongest form of the conjecture implies certain…

Graphical domination was first introduced in [1] in the context of combinatorial threshold-linear networks (CTLNs). There it was shown that when a domination relationship exists between a pair of vertices in a graph, certain fixed points in…

For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12],…

Let $\ell$ be a rational prime. We show that an analogue of a conjecture of Greenberg in graph theory holds true. More precisely, we show that when $n$ is sufficiently large, the $\ell$-adic valuation of the number of spanning trees at the…

Recently, Milani\v{c} and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider…

This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…