Many T copies in H-free graphs

2016/04/09 by Noga Alon, Clara Shikhelman · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bipartite graph #Combinatorics #Computer science #Discrete mathematics #Graph #Graph theory and applications #Integer (computer science) #Limits and Structures in Graph Theory #Mathematics

paper · pdf · doi:10.1016/j.jctb.2016.03.004

openalex publication_date 2016/04/09 · crossref created 2016/04/09 · crossref issued 2016/11/01 · crossref published 2016/11/01 · crossref published-print 2016/11/01 · crossref deposited 2020/11/11 · openalex created_date 2025/10/10 · crossref indexed 2026/08/06 · openalex updated_date 2026/08/06

Citations

• On a problem of K. Zarankiewicz
• On extremal problems of graphs and generalized graphs
• Norm-Graphs: Variations and Applications
• On Graphs that do not Contain a Thomsen Graph
• On the number of pentagons in triangle-free graphs
• New Asymptotics for Bipartite Turán Numbers
• On the number of complete subgraphs contained in certain graphs
• Efficient Testing of Large Graphs

Cited by

• A Generalized Tur'an Problem and its Applications
• Turán's theorem [wikipedia]