Stability results for vertex Turán problems in Kneser graphs

zbMath1410.05213arXiv1804.03988MaRDI QIDQ2415074

Dániel Gerbner, Máté Vizer, Dániel T. Nagy, Balázs Patkós, Abhishek Methuku

Publication date: 20 May 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.03988

zbMATH Keywords

Erdős-Ko-Rado theoremErdős matching conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Distance in graphs (05C12)

Related Items (2)

Size and structure of large \((s,t)\)-union intersecting families ⋮ On the general position problem on Kneser graphs

Cites Work

• Improved bounds for Erdős' matching conjecture
• Union-intersecting set systems
• On the maximum number of edges in a hypergraph with given matching number
• Extremal \(G\)-free induced subgraphs of Kneser graphs
• Cycles of even length in graphs
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Almost Intersecting Families of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Some Theorems on Abstract Graphs
• On a problem of K. Zarankiewicz

This page was built for publication: Stability results for vertex Turán problems in Kneser graphs