activity
20112026
most citedOn Turán exponents of bipartite graphs

17 citations · 57 across the 36 of their papers we have counts for

collaborators
Showing 2024 · math.COShow all

6 papers · 2 filters

math.CO2024

On the clique number of random Cayley graphs and related topics

David Conlon, Jacob Fox, Huy Tuan Pham +1

We prove that a random Cayley graph on a group of order has clique number with high probability. This bound is best possible up to the constant factor f…

math.CO2024

Treewidth, Hadwiger Number, and Induced Minors

Rutger Campbell, James Davies, Marc Distel +7

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence o…

math.CO2024

Regular bipartite decompositions of pseudorandom graphs

Asaf Ferber, Bryce Frederickson, Dingjia Mao +2

In 1972, Kotzig proved that for every even , the complete graph can be decomposed into edge-disjoint regular bipartite spanning subgraphs, which is b…

math.CO2024

Counterexample to Babai's lonely colour conjecture

James Davies, Meike Hatzel, Liana Yepremyan

Motivated by colouring minimal Cayley graphs, in 1978, Babai conjectured that no-lonely-colour graphs have bounded chromatic number. We disprove this in a strong sense by construct…

math.CO2024★ 1 cited

Longest cycles in vertex-transitive and highly connected graphs

Carla Groenland, Sean Longbrake, Raphael Steiner +2

We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively,…

math.CO2024★ 2 cited

Tree Posets: Supersaturation, Enumeration, and Randomness

Tao Jiang, Sean Longbrake, Sam Spiro +1

We develop a powerful tool for embedding any tree poset of height in the Boolean lattice which allows us to solve several open problems in the area. We show that: * If …