-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Authors:
- Noga AlonNANoga Alon
- Clara ShikhelmanCSClara Shikhelman
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (4) , 988-996
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- BSF
- ISF
- GIF
- ISF
This publication has 13 references indexed in Scilit:
- Many T copies in H-free graphsJournal of Combinatorial Theory, Series B, 2016
- Additive approximation for edge-deletion problemsAnnals of Mathematics, 2009
- Problems and results in extremal combinatorics—IIDiscrete Mathematics, 2008
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphsJournal of Combinatorial Theory, Series B, 2006
- Density Conditions For Triangles In Multipartite GraphsCombinatorica, 2006
- $H$-Free Graphs of Large Minimum DegreeThe Electronic Journal of Combinatorics, 2006
- Efficient Testing of Large GraphsCombinatorica, 2000
- On the connection between chromatic number, maximal clique and minimal degree of a graphDiscrete Mathematics, 1974
- On a valence problem in extremal graph theoryDiscrete Mathematics, 1973
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946