13 citations · 115 across the 49 of their papers we have counts for
6 papers · 1 filter
On generalized Ramsey numbers in the non-integral regime
Patrick Bennett, Michelle Delcourt, Lina Li +1
A -coloring of a graph is an edge-coloring of such that every -clique receives at least colors. In 1975, Erdős and Shelah introduced the generalized Ramsey nu…
The limit in the -Problem of Brown, Erdős and Sós exists for all
Michelle Delcourt, Luke Postle
Let be the maximum number of edges of an -uniform hypergraph on~ vertices not containing a subgraph with ~edges and at most ~vertices. In 1973, Brown,…
11/4-colorability of subcubic triangle-free graphs
Zdeněk Dvořák, Bernard Lidický, Luke Postle
We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are e…
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Michelle Delcourt, Luke Postle
In 1973, Erdős conjectured the existence of high girth -Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate v…
Local Hadwiger's Conjecture
Benjamin Moore, Luke Postle, Lise Turner
We propose local versions of Hadwiger's Conjecture, where only balls of radius around each vertex are required to be -minor-free. We ask: if a graph is local…
The chromatic number of triangle-free hypergraphs
Lina Li, Luke Postle
A triangle in a hypergraph is a set of three distinct edges and three distinct vertices such that $\{u, v\}\subset…