On the stability of the Erdös-Ko-Rado theorem

DOI10.1134/S1064562415030102zbMath1328.05189MaRDI QIDQ498190

M. M. Pyaderkin

Publication date: 28 September 2015

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

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Independence numbers of random subgraphs of distance graphs ⋮ Independence numbers of random subgraphs of some distance graph ⋮ On the stability of the independence number of a random subgraph ⋮ On the random version of the Erdős matching conjecture ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• The complete intersection theorem for systems of finite sets
• Lectures on advances in combinatorics
• Distance graphs with large chromatic numbers and small clique numbers
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• Borsuk's problem and the chromatic numbers of some metric spaces
• Erdös–Ko–Rado Theorem—22 Years Later
• The problems of Borsuk and Grunbaum on lattice polytopes
• Erdős–Ko–Rado in Random Hypergraphs
• On the chromatic number of a space with forbidden equilateral triangle
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• On intersecting families of finite sets

This page was built for publication: On the stability of the Erdös-Ko-Rado theorem