On the stability of some Erdős-Ko-Rado type results

DOI10.1016/j.disc.2016.11.015zbMath1355.05190arXiv1509.08980OpenAlexW2238499597MaRDI QIDQ507514

M. M. Pyaderkin

Publication date: 6 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremrandom graphKneser graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

On Ramsey numbers for arbitrary sequences of graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Independence numbers of random subgraphs of some distance graph ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On the stability of the independence number of a random subgraph ⋮ On the random version of the Erdős matching conjecture ⋮ Random Kneser graphs and hypergraphs ⋮ On the chromatic number of a random subgraph of the Kneser graph ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ Degree versions of theorems on intersecting families via stability ⋮ Regular intersecting families ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple removal lemma for large nearly-intersecting families
• Independence numbers of random subgraphs of distance graphs
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• Forbidding just one intersection
• The complete nontrivial-intersection theorem for systems of finite sets
• On “stability” in the Erdös--Ko--Rado Theorem
• Coloring Distance Graphs and Graphs of Diameters
• Coloring some finite sets in {R}^{n}
• Research Problems in Discrete Geometry
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Combinatorial Geometry and Coding Theory*
• On intersecting families of finite sets

This page was built for publication: On the stability of some Erdős-Ko-Rado type results