1.2k citations
- California Institute of TechnologyUS29 papers
- Pennsylvania State UniversityUS28 papers
- Massachusetts Institute of TechnologyUS26 papers
- Rutherford Appleton LaboratoryGB22 papers
- Yale UniversityUS22 papers
- The University of Texas at AustinUS21 papers
- Max Planck Institute for Gravitational PhysicsDE20 papers
- Indiana University BloomingtonUS19 papers
- Northwestern UniversityUS19 papers
- University of California, BerkeleyUS19 papers
- University of WashingtonUS19 papers
- Michigan State UniversityUS18 papers
6 papers · 1 filter
Influences of monotone Boolean functions
Demetres Christofides
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this s…
Cycles Of Given Length In Oriented Graphs
Luke Kelly, Daniela Kühn, Deryk Osthus
We show that for each \ell\geq 4 every sufficiently large oriented graph G with δ^+(G), δ^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all t…
A Dirac type result on Hamilton cycles in oriented graphs
Luke Kelly, Daniela Kühn, Deryk Osthus
We show that for each α>0 every sufficiently large oriented graph G with δ^+(G),δ^-(G)\ge 3|G|/8+ α|G| contains a Hamilton cycle. This gives an approximate solution to a problem of…
k-Ordered Hamilton cycles in digraphs
Daniela Kühn, Deryk Osthus, Andrew Young
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k dist…
Linkedness and ordered cycles in digraphs
Daniela Kühn, Deryk Osthus
The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at…
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn +1
Chvátal, Rödl, Szemerédi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hyperg…