A note on the Tur\'an number of a Berge odd cycle

Dániel Gerbner

Type: Preprint

Publication Date: 2019-03-03

Citations: 3

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	A note on the Turán number of a Berge odd cycle	2019	Dániel Gerbner
+	On 3-uniform hypergraphs without a cycle of a given length	2016	Zoltán Füredi Lale Özkahya
+	The Turán Number of Berge-$K_4$ in 3-Uniform Hypergraphs	2020	Hui Zhu Liying Kang Zhenyu Ni Erfang Shan
+	Avoiding long Berge cycles, the missing cases $k=r+1$ and $k = r+2$	2018	Beka Ergemlidze Ervin Győri Abhishek Methuku Nika Salia Casey Tompkins Oscar Zamora
+	A note on maximum size of Berge-$C_4$-free hypergraphs	2020	Beka Ergemlidze
+	A note on maximum size of Berge-$C_4$-free hypergraphs	2020	Beka Ergemlidze
+	Hypergraphs with No Cycle of a Given Length	2012	Ervin Györi Nathan Lemons
+	On $3$-uniform hypergraphs avoiding a cycle of length four	2020	Beka Ergemlidze Ervin Győri Abhishek Methuku Nika Salia Casey Tompkins
+ PDF Chat	Extremal Results for Berge Hypergraphs	2017	Dániel Gerbner Cory Palmer
+ PDF Chat	On $3$-uniform hypergraphs avoiding a cycle of length four	2023	Beka Ergemlidze Ervin Győri Abhishek Methuku Nika Salia Casey Tompkins
+	A note on the Turán number of a Berge odd cycle.	2021	Dániel Gerbner
+	The Tur\'an number of Berge book hypergraphs	2021	Dániel Gerbner
+	Avoiding long Berge cycles, the missing cases $k=r+1$ and $k = r+2$.	2018	Beka Ergemlidze Ervin Győri Abhishek Methuku Nika Salia Casey Tompkins Oscar Zamora
+	The Turán number of Berge book hypergraphs	2021	Dániel Gerbner
+	3-uniform linear hypergraphs without a long Berge path	2023	Ervin Györi Nika Salia
+	General lemmas for Berge–Turán hypergraph problems	2020	Dániel Gerbner Abhishek Methuku Cory Palmer
+	Linear three-uniform hypergraphs with no Berge path of given length	2022	Ervin Győri Nika Salia
+	On 3-uniform hypergraphs without a cycle of a given length	2014	Zoltán Füredi Lale Özkahya
+	3-uniform hypergraphs with few Berge paths of length three between any two vertices	2019	Tao Zhang Zixiang Xu Gennian Ge
+	On 3-uniform hypergraphs without a cycle of a given length	2014	Zoltán Füredi Lale Özkahya

Works That Cite This (3)

Action	Title	Year	Authors
+	Anti-Ramsey number of paths in hypergraphs	2019	Ran Gu Jiaao Li Yongtang Shi
+	Ramsey numbers of Berge-hypergraphs and related structures	2018	Nika Salia Casey Tompkins Zhiyu Wang Oscar Zamora
+	Hypergraph based Berge hypergraphs	2019	Martin Balko Dániel Gerbner Dong Yeap Kang Younjin Kim Cory Palmer

Works Cited by This (18)

Action	Title	Year	Authors
+	Many T copies in H-free graphs	2016	Noga Alon Clara Shikhelman
+ PDF Chat	Extremal Results for Berge Hypergraphs	2017	Dániel Gerbner Cory Palmer
+ PDF Chat	A Bound on the Number of Edges in Graphs Without an Even Cycle	2016	Boris Bukh Zilin Jiang
+	On maximal paths and circuits of graphs	1959	P. Erdős Т. Галлаи
+	3-uniform hypergraphs avoiding a given odd cycle	2012	Ervin Győri Nathan Lemons
+	The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs	2012	Ervin Győri Hao Li
+	Triangle-Free Hypergraphs	2006	Ervin Győri
+	Hypergraphs with No Cycle of a Given Length	2012	Ervin Györi Nathan Lemons
+	Counting copies of a fixed subgraph in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e223" altimg="si573.svg"><mml:mi>F</mml:mi></mml:math>-free graphs	2019	Dániel Gerbner Cory Palmer
+	Triangles in $C_5$-free graphs and Hypergraphs of Girth Six	2018	Beka Ergemlidze Abhishek Methuku