Extremal Graphs without Large Forbidden Subgraphs

B Bollobás, P. Erdős, Miklós Simonovits, Endre Szemerédi

Type: Book-Chapter

Publication Date: 1978-01-01

Citations: 50

DOI: https://doi.org/10.1016/s0167-5060(08)70495-3

View Publication

Download PDF

Locations

Annals of discrete mathematics - View
CiteSeer X (The Pennsylvania State University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Extremal Problems	1979	Béla Bollobás
+	Extremal graphs for clique-paths	2011	Roman Glebov
+	Extremal theory of vertex or edge ordered graphs	2019	Gábor Tardos
+	Extremal graphs without long paths and large cliques	2023	Gyula O. H. Katona Chuanqi Xiao
+	Extremal graphs without exponentially-small bicliques	2021	Boris Bukh
+ PDF Chat	Extremal graphs without exponentially small bicliques	2024	Boris Bukh
+	Minimum maximal graphs with forbidden subgraphs	1985	Frank Harary Michael Plantholt
+	Many cliques with few edges in a graph where the maximum degree is upper-bounded	2020	Debsoumya Chakraborti Da Qi Chen
+ PDF Chat	Extremal Graphs without Topological Complete Subgraphs	2004	M. Cera A. Diánez Alberto Márquez
+ PDF Chat	Extremal number of arborescences	2024	Aditya Bandekar Péter Csíkvári Benjamin Mascuch Damján Tárkányi Márton Telekes Lilla Tóthmérész
+ PDF Chat	Many cliques with few edges and bounded maximum degree	2021	Debsoumya Chakraborti Da Qi Chen
+ PDF Chat	Compactness results in extremal graph theory	1982	Paul Erdős Miklós Simonovits
+	Extremal Graphs without Cycles of Length 8 or Less	2011	Kim Marshall Mirka Miller Joe Ryan
+	Graphs with large maximum degree containing no odd cycles of a given length	2003	Paul Balister Béla Bollobás Oliver Riordan R. H. Schelp
+	The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree	2013	Weihua Yang Yingzhi Tian Hengzhe Li Hao Li Xiaofeng Guo
+	New exact values of the maximum size of graphs free of topological complete subgraphs	2006	C. Balbuena M. Cera A. Diánez P. García‐Vázquez
+	Maxima of the $Q$-index of non-bipartite graphs: forbidden short odd cycles	2022	Miao Lu Ruifang Liu Jie Xue
+	Unavoidable hypergraphs	2020	M. Bucić N. Draganić B. Sudakov The Dung Tran
+	Extremal irregular digraphs	2018	Zyta Dziechcińska-Halamoda Joanna Górska Zofia Majcher Jerzy Michael Zdzisław Skupień
+	Extremal problems and generalized degrees	1994	P. Erdős Ralph J. Faudree Cecil Rousseau

Works That Cite This (32)

Action	Title	Year	Authors
+	Variations on the theme of repeated distances	1990	Péter L. Erdős János Pach
+	testing of large graphs	2000	Noga Alon Eldar Fischer Michael Krivelevich Márió Szegedy
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Subdivisions of Transitive Tournaments	2000	Alex Scott
+ PDF Chat	Unit Distances and Diameters in Euclidean Spaces	2008	Konrad J. Swanepoel
+	Property Testing in Hypergraphs and the Removal Lemma (Extended Abstract)	2007	Mathias Schacht
+	Generating all subsets of a finite set with disjoint unions	2011	David Ellis Benny Sudakov
+ PDF Chat	An algorithmic version of the blow‐up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Tight Bounds for Testing Bipartiteness in General Graphs	2004	Tali Kaufman Michael Krivelevich Dana Ron
+	Generating all subsets of a finite set with disjoint unions	2010	David Ellis Benny Sudakov

Works Cited by This (4)

Action	Title	Year	Authors
+	An extremal graph problem	1972	P. Erdős Miklós Simonovits
+ PDF Chat	On the structure of linear graphs	1946	Paul Erdős A. H. Stone
+	On the Structure of Edge Graphs	1973	Béla Bollobás Paul Erdős
+ PDF Chat	On the Structure of Edge Graphs II	1976	B Bollobás P. Erdős Miklós Simonovits