On the chromatic number of random subgraphs of a certain distance graph

DOI10.1016/j.dam.2019.07.002zbMath1419.05080OpenAlexW2962679774WikidataQ127446295 ScholiaQ127446295MaRDI QIDQ2322889

M. M. Pyaderkin

Publication date: 5 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.07.002

zbMATH Keywords

independence numberchromatic numberdistance graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (7)

On the independence number and the chromatic number of generalized preferential attachment models ⋮ Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ 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)\) ⋮ Chromatic numbers of Kneser-type graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• Unnamed Item
• On random subgraphs of Kneser and Schrijver graphs
• Independence numbers of random subgraphs of a distance graph
• A simple removal lemma for large nearly-intersecting families
• Random Kneser graphs and hypergraphs
• On the chromatic number of a random subgraph of the Kneser graph
• Kneser's conjecture, chromatic number, and homotopy
• On the stability of the Erdős-Ko-Rado theorem
• Forbidding just one intersection
• On the stability of the independence number of a random subgraph
• On the chromatic numbers of some distance graphs
• Independence numbers of random subgraphs of some distance graph
• Clique chromatic numbers of intersection graphs
• New upper bound for the chromatic number of a random subgraph of a distance graph
• On the chromatic numbers of low-dimensional spaces
• On “stability” in the Erdös--Ko--Rado Theorem
• Coloring some finite sets in {R}^{n}
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Cliques in random graphs
• On the chromatic number of an infinitesimal plane layer
• The realization of distances within sets in Euclidean space
• On the chromatic numbers of small-dimensional Euclidean spaces
• The chromatic number of random graphs

This page was built for publication: On the chromatic number of random subgraphs of a certain distance graph