Asymptotics of the independence number of a random subgraph of the graph G(n,r,

DOI10.1134/S0001434622010138zbMATH Open1484.05189OpenAlexW4213429878MaRDI QIDQ2113406FDOQ2113406

V. S. Karas', Andrei M. Raigorodskii

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010138

Recommendations

Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
On stability of the independence number of a certain distance graph
Independence numbers of random subgraphs of distance graphs
On the independence number of random graphs
Independence numbers of random subgraphs of a distance graph

zbMATH Keywords

asymptotics independence number random subgraph \(s\)-intersecting set

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
The complete nontrivial-intersection theorem for systems of finite sets
Borsuk's problem and the chromatic numbers of some metric spaces
Coloring Distance Graphs and Graphs of Diameters
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
On the stability of the Erdős-Ko-Rado theorem
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
On the stability of the independence number of a random subgraph
Independence numbers of random subgraphs of some distance graph
Independence numbers of random subgraphs of a distance graph
Independence numbers of random subgraphs of distance graphs
Title not available (Why is that?)
Combinatorial Geometry and Coding Theory*
On the stability of the Erdös-Ko-Rado theorem
On intersecting families of finite sets
On ``stability in the Erdős-Ko-Rado theorem
On the stability of some Erdős-Ko-Rado type results
On random subgraphs of Kneser graphs and their generalizations
Chromatic number of random Kneser hypergraphs
Removal and stability for Erdős-Ko-Rado
Random Kneser graphs and hypergraphs
On the chromatic number of a random subgraph of the Kneser graph
Regular bipartite graphs and intersecting families
Sharp results concerning disjoint cross-intersecting families
Ramsey theory in the -space with Chebyshev metric
A generalization of Kneser graphs
Extremal problems in hypergraph colourings
Degree versions of theorems on intersecting families via stability
New bounds on clique-chromatic numbers of Johnson graphs
Modularity of some distance graphs
New bounds for the clique-chromatic numbers of Johnson graphs
Incompatible intersection properties
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
Simple juntas for shifted families
Estimate of the number of edges in subgraphs of a Johnson graph
On threshold probability for the stability of independent sets in distance graphs
On the chromatic number of random subgraphs of a certain distance graph
Almost-Fisher families

Cited In (4)

On the independence number of random graphs
On the stability of the independence number of a random subgraph
Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
Large cycles in random generalized Johnson graphs

This page was built for publication: Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113406)