A generalized Turán problem and its applications

DOI10.1093/IMRN/RNY108MaRDI QIDQ5015565zbMATH OpenOpenAlexFDO

Authors Lior Gishboliner, Asaf Shapira

Publication date 9 December 2021

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imrn/rny108

zbMATH Keywords

complete graphcycleTuran problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• Graph removal lemmas
• A new proof of the graph removal lemma
• Minimum degree and the graph removal lemma
• Generalized Turán problems for even cycles

Cited in

(33)

• Some sharp results on the generalized Turán numbers
• Some results on k-Turán-good graphs
• Unified approach to the generalized Turán problem and supersaturation
• Generalized Turán densities in the hypercube
• The generalized Turán number of spanning linear forests
• Some exact results for generalized Turán problems
• On generalized Turán number of two disjoint cliques
• The maximum number of cliques in hypergraphs without large matchings
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• The maximum number of paths of length four in a planar graph
• Generalized rainbow Turán numbers of odd cycles
• Some exact results of the generalized Turán numbers for paths
• scientific article; zbMATH DE number 3827993 (Why is no real title available?)
• Lower bounds for rainbow Turan numbers of paths and other trees
• On supersaturation and stability for generalized Turán problems
• Triangles in C5‐free graphs and hypergraphs of girth six
• On the maximum number of odd cycles in graphs without smaller odd cycles
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number
• Minimum degree and the graph removal lemma
• On Turán numbers for disconnected hypergraphs
• Random polynomial graphs for random Turán problems
• Local-vs-global combinatorics
• Many triangles in \(C_5\)-free graphs
• On the generalized Turán problem for odd cycles
• A localized approach to generalized Turán problems
• On the Constructor-Blocker game
• Counting cliques without generalized theta graphs
• Triangle Ramsey numbers of complete graphs
• On generalized Turán number of graphs with bounded matching number
• Posets are easily testable
• Generalized Ramsey-Turán density for cliques
• Exact results for generalized extremal problems forbidding an even cycle
• An efficient asymmetric removal lemma and its limitations

This page was built for publication: A generalized Turán problem and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015565)