Extremal \(G\)-free induced subgraphs of Kneser graphs

DOI10.1016/J.JCTA.2018.06.010zbMath1392.05108arXiv1801.03972OpenAlexW2963131687WikidataQ129634472 ScholiaQ129634472MaRDI QIDQ725003

Ali Taherkhani, Meysam Alishahi

Publication date: 26 July 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremErdős matching conjecture\((s, t)\)-union intersecting family

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Related Items (3)

Size and structure of large \((s,t)\)-union intersecting families ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ On the general position problem on Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• A new short proof of the EKR theorem
• On matchings in hypergraphs
• Union-intersecting set systems
• On the maximum number of edges in a hypergraph with given matching number
• Kneser's conjecture, chromatic number, and homotopy
• The exact bound in the Erdős-Ko-Rado theorem
• Intersection patterns of convex sets
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• On the stability of the Erdős-Ko-Rado theorem
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• An extremal problem for two families of sets
• Conditional chromatic numbers with forbidden cycles
• A combinatorical proof of Kneser's conjecture
• On Erdős' extremal problem on matchings in hypergraphs
• A simple proof of the Erdős-Chao Ko-Rado theorem
• An Erdös-Ko-Rado theorem for direct products
• The Size of a Hypergraph and its Matching Number
• Erdös–Ko–Rado Theorem—22 Years Later
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Almost Intersecting Families of Sets
• Hypergraphs of Bounded Disjointness
• On generalized graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• On intersecting families of finite sets

This page was built for publication: Extremal \(G\)-free induced subgraphs of Kneser graphs