Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
type: Item
instance of: scholarly article
title: Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
zbMATH Open document ID: 1484.05189
DOI: 10.1134/S0001434622010138
author: V. S. Karas'
author: Andrei M. Raigorodskii
published in: Mathematical Notes
publication date: 2022-03-14T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 7488485
zbMATH Keywords: independence number
zbMATH Keywords: random subgraph
zbMATH Keywords: \(s\)-intersecting set
zbMATH Keywords: asymptotics
MaRDI profile type: Publication
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: On intersecting families of finite sets
cites work: The complete nontrivial-intersection theorem for systems of finite sets
cites work: Degree versions of theorems on intersecting families via stability
cites work: Simple juntas for shifted families
cites work: Sharp results concerning disjoint cross-intersecting families
cites work: Regular bipartite graphs and intersecting families
cites work: Incompatible intersection properties
cites work: Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
cites work: Combinatorial Geometry and Coding Theory*
cites work: Ramsey theory in the -space with Chebyshev metric
cites work: Extremal problems in hypergraph colourings
cites work: Q3464534
cites work: Coloring Distance Graphs and Graphs of Diameters
cites work: Borsuk's problem and the chromatic numbers of some metric spaces
cites work: Modularity of some distance graphs
cites work: New bounds for the clique-chromatic numbers of Johnson graphs
cites work: New bounds on clique-chromatic numbers of Johnson graphs
cites work: A generalization of Kneser graphs
cites work: On the stability of the Erdős-Ko-Rado theorem
cites work: On the stability of some Erdős-Ko-Rado type results
cites work: Almost-Fisher families
cites work: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
cites work: Chromatic number of random Kneser hypergraphs
cites work: On the chromatic number of a random subgraph of the Kneser graph
cites work: Random Kneser graphs and hypergraphs
cites work: On random subgraphs of Kneser graphs and their generalizations
cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
cites work: Removal and stability for Erdős-Ko-Rado
cites work: On ``stability'' in the Erdős-Ko-Rado theorem
cites work: Independence numbers of random subgraphs of some distance graph
cites work: Independence numbers of random subgraphs of a distance graph
cites work: Independence numbers of random subgraphs of distance graphs
cites work: On the stability of the independence number of a random subgraph
cites work: On the chromatic number of random subgraphs of a certain distance graph
cites work: On threshold probability for the stability of independent sets in distance graphs
cites work: On the stability of the Erdös-Ko-Rado theorem
cites work: Estimate of the number of edges in subgraphs of a Johnson graph
full work available at URL: s0001434622010138
OpenAlex ID: W4213429878
description: scientific article; zbMATH DE number 7488485