17 citations · 57 across the 36 of their papers we have counts for
46 papers
An improved minimum degree threshold for fractional clique decompositions in partite graphs
Sean Longbrake, Michael Simkin, Liana Yepremyan +1
We prove a Dirac-type condition for an -partite graph to admit a fractional clique decomposition: every sufficiently large -partite graph with vertices in each part and p…
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang +5
The rational exponents conjecture of Erdős and Simonovits asserts that for every rational there exists a graph such that . We present a pr…
Generic solutions to symmetric linear equations
Bryce Frederickson, Liana Yepremyan
In 1993, Ruzsa showed that for every , there exists a constant such that every subset of size at least contains distinct elements $…
Minimal Cayley graphs with large chromatic number
James Davies, Meike Hatzel, Liana Yepremyan
Resolving Babai's minimal Cayley graph problem, we construct finite minimal Cayley graphs with arbitrarily large chromatic number.
Rational exponents near 3/2
Tao Jiang, Sean Longbrake, Liana Yepremyan
Given a graph , the extremal number is the maximum number of edges in an -vertex graph not containing as a subgraph. The well-known rational exponents conjectur…
On the generalized Turán number of complete bipartite graphs
Oliver Janzer, Sean Longbrake, Liana Yepremyan
For graphs and , the generalized Turán number denotes the maximum number of copies of in an -free graph on vertices. We prove that if $s\in \…
On the number of families avoiding a subposet
Tao Jiang, Sean Longbrake, Liana Yepremyan
In this paper we show that for any poset that is not an antichain, the number of induced -free families in the Boolean lattice is at most $ 2^{O(\mathrm{La}^*(n,P)…
Long cycles in vertex transitive digraphs
Matija Bucić, Kevin Hendrey, Bojan Mohar +2
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this f…
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…
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…
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…
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…
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…
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,…
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 …
Vector space Ramsey numbers and weakly Sidorenko affine configurations
Bryce Frederickson, Liana Yepremyan
For , the -th affine extremal number of is the maximum cardinality of a set with no subset which is affinely isomorphi…
Correspondence coloring of random graphs
Zdenek Dvorak, Liana Yepremyan
We show that Erdős-Rényi random graphs with constant density have correspondence chromatic number ; this matches a prediction from linear Hadwige…
On The Random Turán number of linear cycles
Dhruv Mubayi, Liana Yepremyan
Given two -uniform hypergraphs and the Turán number is the maximum number of edges in an -free subgraph of . We study the typical value of $\rm{ex}…
Decomposing cubic graphs into isomorphic linear forests
Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy +1
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald c…
Enumerating independent sets in Abelian Cayley graphs
Aditya Potukuchi, Liana Yepremyan
We show that any connected Cayley graph on an Abelian group of order and degree has at most independent sets. This bound is tight up…
Rainbow subdivisions of cliques
Tao Jiang, Shoham Letzter, Abhishek Methuku +1
We show that for every integer and large , every properly edge-coloured graph on vertices with at least edges contains a rainbow subdivision of $…