28 citations · 47 across the 15 of their papers we have counts for
19 papers
Towards the Lovász conjecture via sublinear expanders
Matija Bucić, Micha Christoph, Alexey Pokrovskiy +1
Lovász' famous Hamiltonicity conjecture (1969) states that every connected vertex-transitive graph has a Hamiltonian path. A stronger version of the conjecture, often attributed to…
Uniform Turán density of cycles
Matija Bucić, Jacob W. Cooper, Daniel Kráľ +2
In the early 1980s, Erdős and Sós initiated the study of the classical Turán problem with a uniformity condition: the uniform Turán density of a hypergraph is the infimum over…
Turán numbers of sunflowers
Domagoj Bradač, Matija Bucić, Benny Sudakov
A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in ex…
Covering random graphs with monochromatic trees
Domagoj Bradač, Matija Bucić
Given an -edge-coloured complete graph , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known e…
Counting -free orientations of graphs
Matija Bucić, Oliver Janzer, Benny Sudakov
In 1974, Erdős posed the following problem. Given an oriented graph , determine or estimate the maximum possible number of -free orientations of an -vertex graph. When …
Cycles of many lengths in Hamiltonian graphs
Matija Bucić, Lior Gishboliner, Benny Sudakov
In 1999, Jacobson and Lehel conjectured that for , every -regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthen…