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

DOI10.1134/S0001434622010138MaRDI QIDQ2113406zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

asymptoticsindependence numberrandom 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)

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

Cites work

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• A generalization of Kneser graphs
• Almost-Fisher families
• Borsuk's problem and the chromatic numbers of some metric spaces
• Chromatic number of random Kneser hypergraphs
• Coloring distance graphs and graphs of diameters
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Combinatorial geometry and coding theory
• Degree versions of theorems on intersecting families via stability
• Estimate of the number of edges in subgraphs of a Johnson graph
• Extremal problems in hypergraph colourings
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Incompatible intersection properties
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Independence numbers of random subgraphs of a distance graph
• Independence numbers of random subgraphs of distance graphs
• Independence numbers of random subgraphs of some distance graph
• Modularity of some distance graphs
• New bounds for the clique-chromatic numbers of Johnson graphs
• New bounds on clique-chromatic numbers of Johnson graphs
• On ``stability in the Erdős-Ko-Rado theorem
• On intersecting families of finite sets
• On random subgraphs of Kneser graphs and their generalizations
• On the chromatic number of a random subgraph of the Kneser graph
• On the chromatic number of random subgraphs of a certain distance graph
• On the stability of some Erdős-Ko-Rado type results
• On the stability of the Erdös-Ko-Rado theorem
• On the stability of the Erdős-Ko-Rado theorem
• On the stability of the independence number of a random subgraph
• On threshold probability for the stability of independent sets in distance graphs
• Ramsey theory in the \(n\)-space with Chebyshev metric
• Random Kneser graphs and hypergraphs
• Regular bipartite graphs and intersecting families
• Removal and stability for Erdős-Ko-Rado
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Sharp results concerning disjoint cross-intersecting families
• Simple juntas for shifted families
• The complete nontrivial-intersection theorem for systems of finite sets
• Transference for the Erdős-Ko-Rado theorem

Cited in

(7)

• On stability of the independence number of a certain distance graph
• Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
• On the independence number of random graphs
• On the stability of the independence number of a random subgraph
• Large cycles in random generalized Johnson graphs
• Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
• The \(t\)-stability number of a random graph

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)