Ks-Free Graphs Without Large Kr-Free Subgraphs

Michael Krivelevich

Type: Article

Publication Date: 1994-09-01

Citations: 33

DOI: https://doi.org/10.1017/s0963548300001243

View Publication

Locations

Combinatorics Probability Computing - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	On subgraphs of <i>C</i><sub>2<i>k</i></sub>-free graphs and a problem of Kühn and Osthus	2020	Dániel Grósz Abhishek Methuku Casey Tompkins
+	<i>K</i><sub>5</sub>-minor-free graphs	2017	Martin Grohe
+	The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs	2011	József Balogh Wojciech Samotij
+	Improved lower bounds on <i>k</i>‐independence	1991	Yair Caro Źsolt Tuza
+ PDF Chat	Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite	2020	József Balogh Felix Christian Clemen M. I. Lavrov Bernard Lidický Florian Pfender
+	On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub>	1995	Peter Braß Heiko Harborth Hauke Nienborg
+	Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs	1991	Yoshimi Egawa Katsuhiro Ota
+ PDF Chat	Arbitrarily partitionable <i>\{2K<sub>2</sub>, C<sub>4</sub>\}</i>-free graphs	2020	Fengxia Liu Baoyindureng Wu Jixiang Meng
+ PDF Chat	Characterisation of {<i>P</i><sub>4</sub>, <i>K</i> ̅<sub>3</sub>}-free graphs	2017	Estiaan Murrell Klem S. ter Horst
+ PDF Chat	Bollob\'{a}s-Erd\H{o}s-Tuza conjecture for graphs with no induced $K_{s,t}$	2024	Xinbu Cheng Zixiang Xu
+	An extremal problem on <i>K<sub>r</sub></i>‐free graphs	1988	Péter Frankl János Pach
+	Regular factors in <i>K</i><sub>1,3</sub>‐free graphs	1991	S.A. Choudum M.S. Paulraj
+	Large subgraphs without complete bipartite graphs	2014	David Conlon Jacob Fox Benny Sudakov
+ PDF Chat	Minimizing the number of complete bipartite graphs in a <i>K<sub>s</sub></i>-saturated graph	2021	Beka Ergemlidze Methuku Methuku Michael Tait Craig Timmons
+	Graphs Having Small Number of Sizes on Induced k‐Subgraphs	2007	Maria Axenovich József Balogh
+	Sharp upper bounds on the $k$-independence number in regular graphs	2019	Zhenyu Taoqiu O Suil Yongtang Shi
+	Remarks on component factors in <i>K</i><sub>1,<i>r</i></sub>-free graphs	2023	Guowei Dai Zan‐Bo Zhang Xiaoyan Zhang
+ PDF Chat	Induced subgraphs of $K_r$-free graphs and the Erd\H{o}s--Rogers problem	2024	Lior Gishboliner Oliver Janzer Benny Sudakov
+	(<i>k</i>+1)-Cores Have <i>k</i>-Factors	2012	Siu On Chan Michael Molloy
+	Induced Turán numbers	2016	Po‐Shen Loh Michael Tait Craig Timmons Rodrigo Zhou

Works That Cite This (33)

Action	Title	Year	Authors
+	On generalized Ramsey numbers of Erdős and Rogers	2014	Andrzej Dudek Troy Retter Vojtěch Rödl
+	K 4-free graphs without large induced triangle-free subgraphs	2013	Guy Wolfovitz
+	An almost quadratic bound on vertex Folkman numbers	2009	Andrzej Dudek Vojtěch Rödl
+	On the order of the classical Erdős–Rogers functions	2024	Dhruv Mubayi Jacques Verstraëte
+ PDF Chat	When does the <i>K</i><sub>4</sub>‐free process stop?	2012	Lutz Warnke
+ PDF Chat	On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs	2013	Andrzej Dudek Dhruv Mubayi
+	On the Ramsey-Tur\'an number with small $s$-independence number	2015	Patrick Bennett Andrzej Dudek
+	On the Ramsey–Turán number with small s-independence number	2016	Patrick Bennett Andrzej Dudek
+ PDF Chat	On the minimum degree of minimal Ramsey graphs for multiple colours	2016	Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó
+ PDF Chat	Short proofs of some extremal results II	2016	David Conlon Jacob Fox Benny Sudakov

Works Cited by This (7)

Action	Title	Year	Authors
+	Infinite and Finite Sets	2003	Ethan D. Bloch
+	Minimum number of elements representing a set system of given rank	1989	Zsolt Tuza
+	Local and Global Clique Numbers	1994	Nathan Linial Yuri Rabinovich
+	Local constraints ensuring small representing sets	1991	P. Erdős A. Hajnal Zsolt Tuza
+	Graphs without large triangle free subgraphs	1991	B. Bollobás H.R. Hind
+ PDF Chat	The Construction of Certain Graphs	1962	Péter L. Erdős C. A. Rogers
+ PDF Chat	On Turán’s theorem for sparse graphs	1981	Miklós Ajtai Paul Erdős János Komlós Endre Szemerédi

<i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs

Locations

Similar Works

Works That Cite This (33)

Works Cited by This (7)