Clique numbers of random subgraphs of some distance graphs

DOI10.1134/S0032946018020059zbMath1415.05133OpenAlexW2884612267MaRDI QIDQ2314150

A. S. Gusev

Publication date: 19 July 2019

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

zbMATH Keywords

random subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On random subgraphs of Kneser and Schrijver graphs
• Independence numbers of random subgraphs of distance graphs
• On chromatic numbers of nearly Kneser distance graphs
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the stability of some Erdős-Ko-Rado type results
• On random subgraphs of Kneser graphs and their generalizations
• On the stability of the Erdős-Ko-Rado theorem
• New upper bound for the chromatic number of a random subgraph of a distance graph
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• Combinatorial Geometry and Coding Theory*
• The chromatic number of random graphs

This page was built for publication: Clique numbers of random subgraphs of some distance graphs