J. Polcyn

activity

20152024

most citedOn Hamiltonian cycles in hypergraphs with dense link graphs

9 citations · 28 across the 18 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

One more Turán number and Ramsey number for the loose 3-uniform path of length three

Joanna Polcyn

Let $P$ denote a 3-uniform hypergraph consisting of 7 vertices $a, b, c, d, e, f, g$ and 3 edges ${a, b, c}, {c, d, e},$ and ${e, f, g}$ . It is known that the $r$ -color Ramsey number for…

math.CO2015

Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three

Joanna Polcyn, Andrzej Ruciński

Let $P$ denote a 3-uniform hypergraph consisting of 7 vertices $a, b, c, d, e, f, g$ and 3 edges ${a, b, c}, {c, d, e},$ and ${e, f, g}$ . It is known that the $r$ -color Ramsey number for…

math.CO2015

Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three

Eliza Jackowska, Joanna Polcyn, Andrzej Ruciński

Let $P$ denote a 3-uniform hypergraph consisting of 7 vertices $a, b, c, d, e, f, g$ and 3 edges ${a, b, c}, {c, d, e},$ and ${e, f, g}$ . It is known that the $r$ -colored Ramsey number f…

math.CO2015

Turán numbers for 3-uniform linear paths of length 3

Eliza Jackowska, Joanna Polcyn, Andrzej Ruciński

In this paper we confirm a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán number $e x_{3} (n; P_{3}^{3})$ of the 3-uniform linear path $P_{3}^{3}$ of len…