17 citations · 57 across the 36 of their papers we have counts for
4 papers · 2 filters
On Independent Spanning Trees in Random and Pseudorandom Graphs
Nemanja Draganić, Keith Frankston, Michael Krivelevich +2
In 1989, Zehavi and Itai conjectured that every -connected graph contains independent spanning trees rooted at any prescribed vertex . That is, for each vertex , the u…
Size-Ramsey numbers of tight paths
Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan
The -colour size-Ramsey number of a hypergraph is the minimum number of edges in a hypergraph whose every -edge-colouring contains a monochromatic copy of . We sho…
Supersaturation via edge-gluing
Zihao Jin, Sean Longbrake, Liana Yepremyan
In 1984, Erdős and Simonovits conjectured the following: given a bipartite graph , there exist constants such that any graph on vertices and $pn^2\geq C \math…
Towards Graham's rearrangement conjecture via rainbow paths
Matija Bucić, Bryce Frederickson, Alp Müyesser +2
We study an old question in combinatorial group theory which can be traced back to a conjecture of Graham from 1971. Given a group , and some subset , is it possib…