On stability of the independence number of a certain distance graph
From MaRDI portal
Publication:2229578
DOI10.1134/S0032946020040055zbMath1459.05308OpenAlexW3121773111MaRDI QIDQ2229578
P. A. Ogarok, Andrei M. Raigorodskii
Publication date: 18 February 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946020040055
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the minimal number of edges in induced subgraphs of special distance graphs ⋮ Lower bound on the minimum number of edges in subgraphs of Johnson graphs ⋮ Large cycles in random generalized Johnson graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple removal lemma for large nearly-intersecting families
- On random subgraphs of Kneser graphs and their generalizations
- On the stability of the Erdős-Ko-Rado theorem
- Chromatic number of random Kneser hypergraphs
- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- A generalization of Kneser graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- Modularity of some distance graphs
- On threshold probability for the stability of independent sets in distance graphs
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Clique chromatic numbers of intersection graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- The number of edges in induced subgraphs of some distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Degree versions of theorems on intersecting families via stability
- Regular intersecting families
- Counterexamples to Borsuk's conjecture with large girth
- On the size of $K$-cross-free families
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Excursions into combinatorial geometry
- Removal and Stability for Erdös--Ko--Rado
- On “stability” in the Erdös--Ko--Rado Theorem
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- Extremal problems in hypergraph colourings
- Ramsey theory in the -space with Chebyshev metric
- Partition‐free families of sets
