Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.02569

Covering random graphs with monochromatic trees

Domagoj Bradač·Matija Bucić
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given an $r$-edge-coloured complete graph $K_n$, how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known essentially equivalent formulation of the classical Ryser's conjecture which, despite a lot of attention over the last 50 years, still remains open. A number of recent papers consider a sparse random analogue of this question, asking for the minimum number of monochromatic components needed to cover the vertex set of an $r$-edge-coloured random graph $\mathcal{G}(n,p)$. Recently, Bucić, Korándi and Sudakov established a connection between this problem and a certain Helly-type local to global question for hypergraphs raised about 30 years ago by Erdős, Hajnal and Tuza. We identify a modified version of the hypergraph problem which controls the answer to the problem of covering random graphs with monochromatic components more precisely. To showcase the power of our approach, we essentially resolve the $3$-colour case by showing that $(\log n / n)^{1/4}$ is a threshold at which point three monochromatic components are needed to cover all vertices of a $3$-edge-coloured random graph, answering a question posed by Kohayakawa, Mendonça, Mota and Schülke. Our approach also allows us to determine the answer in the general $r$-edge coloured instance of the problem, up to lower order terms, around the point when it first becomes bounded, answering a question of Bucić, Korándi and Sudakov.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Domagoj Bradač, Matija Bucić. 2022-07-05. Covering random graphs with monochromatic trees. https://arxiv.org/abs/2109.02569

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗