2 citations · 3 across the 10 of their papers we have counts for
6 papers · 1 filter
Turán and Ramsey numbers for -uniform minimal paths of length
Jie Han, Joanna Polcyn, Andrzej Ruciński
We determine Turán numbers for the family of 3-uniform minimal paths of length four \emph{for all }. We also establish the second and third order Turán numbers and use them to c…
On Hamiltonian cycles in hypergraphs with dense link graphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl +1
We show that every -uniform hypergraph on vertices whose minimum -degree is at least contains a Hamiltonian cycle. A construction due to Han and Zha…
Minimum pair degree condition for tight Hamiltonian cycles in -uniform hypergraphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl +3
We show that every 4-uniform hypergraph with vertices and minimum pair degree at least contains a tight Hamiltonian cycle. This degree condition is asymptotic…
The Ramsey number of a long even cycle versus a star
Peter Allen, Tomasz Łuczak, Joanna Polcyn +1
We find the exact value of the Ramsey number , when and are large. Our result is closely related to the behaviour of Turán number $e…
Andrásfai and Vega graphs in Ramsey-Turán theory
Tomasz Łuczak, Joanna Polcyn, Christian Reiher
Given positive integers , we let denote the maximum number of edges in a triangle-free graph on vertices with . In the early sixties…
On the Ramsey-Turán density of triangles
Tomasz Łuczak, Joanna Polcyn, Christian Reiher
One of the oldest results in modern graph theory, due to Mantel, asserts that every triangle-free graphs on vertices has at most edges. About half a cent…