On random subgraphs of Kneser graphs and their generalizations

DOI10.1134/S106456241605015XMaRDI QIDQ512505zbMATH OpenFDO

Authors M. M. Pyaderkin, Andrei M. Raigorodskii

Publication date 27 February 2017

Published in Doklady Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independence number of random subgraphs of distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• Coloring distance graphs and graphs of diameters
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• 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
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems with geometric consequences
• On the stability of the Erdős-Ko-Rado theorem
• Random graphs.
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

Cited in

(16)

• A generating function approach to random subgraphs of the \(n\)-cycle
• On the stability of the independence number of a random subgraph
• On the random version of the Erdős matching conjecture
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
• Sharp bounds for the chromatic number of random Kneser graphs
• Independence numbers of random subgraphs of some distance graph
• On the number of edges of a uniform hypergraph with a range of allowed intersections
• A generalization of Kneser graphs
• On stability of the independence number of a certain distance graph
• On threshold probability for the stability of independent sets in distance graphs
• Clique numbers of random subgraphs of some distance graphs
• Degree versions of theorems on intersecting families via stability
• scientific article; zbMATH DE number 3333197 (Why is no real title available?)
• Sharp bounds for the chromatic number of random Kneser graphs
• Random Kneser graphs and hypergraphs
• On the chromatic number of a random subgraph of the Kneser graph

This page was built for publication: On random subgraphs of Kneser graphs and their generalizations

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