11 citations · 12 across the 5 of their papers we have counts for
6 papers · 1 filter
Fractional colorings of -free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku +2
We study fractional coloring with local demands, a framework introduced by Kelly and Postle in which one seeks a probability distribution on the independent sets of a graph such th…
Degree-sequence bounds for independent sets via multivariate local occupancy
Ewan Davies, Juspreet Singh Sandhu, Jaehyeon Seo +1
We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspi…
Transversal cycles and paths in tournaments
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1
Thomason [ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except…
Hamilton transversals in tournaments
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1
It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizatio…
On a rainbow extremal problem for color-critical graphs
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +2
There has been extensive studies on the following question: given graphs over a common vertex set of size , what conditions on ensures a `colorful' co…
On 1-subdivisions of transitive tournaments
Jaehoon Kim, Hyunwoo Lee, Jaehyeon Seo
The oriented Ramsey number for an acyclic digraph is the minimum integer such that any -vertex tournament contains a copy of as a subgraph. We prove tha…