Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
From MaRDI portal
(Redirected from Publication:3466410)
Recommendations
- New upper bound for the chromatic number of a random subgraph of a distance graph
- Independence numbers and chromatic numbers of some distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Independence numbers of random subgraphs of a distance graph
- The distant-l chromatic number of random geometric graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Independence numbers of random subgraphs of some distance graph
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On large subgraphs with small chromatic numbers contained in distance graphs
- The chromatic number of random graphs
Cites work
- A note on the realization of distances within sets in euclidean space
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- Around Borsuk's hypothesis
- Borsuk's problem for (0,1)-polytopes and cross-polytopes
- Cliques in random graphs
- Coloring distance graphs and graphs of diameters
- Coloring some finite sets in R^n
- Counterexamples to Borsuk's conjecture on spheres of small radii
- Erdös–Ko–Rado Theorem—22 Years Later
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On a packing and covering problem
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Pseudo-random graphs
- Research Problems in Discrete Geometry
- The chromatic number of random graphs
- The chromatic number of random graphs
- The Mathematical Coloring Book
- The problem of Borsuk, Hadwiger,and Grünbaum for some classes of polytopes and graphs
- The realization of distances within sets in Euclidean space
- Three lectures on the Borsuk partition problem
Cited in
(35)- Chromatic number of random Kneser hypergraphs
- Diameters of random distance graphs
- 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
- Chromatic numbers of some distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- Clique numbers of random subgraphs of some distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Degree versions of theorems on intersecting families via stability
- On large subgraphs of a distance graph which have small chromatic number
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the chromatic numbers of low-dimensional spaces
- The Nelson-Erdős-Hadwiger problem and embeddings of random graphs into geometric ones
- Independence numbers and chromatic numbers of some distance graphs
- On random subgraphs of Kneser and Schrijver graphs
- On large subgraphs with small chromatic numbers contained in distance graphs
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance graphs
- The Nelson-Erdős-Hadwiger problem and a space realization of a random graph
- 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
- Sharp threshold for the Erdős–Ko–Rado theorem
- Independence numbers of Johnson-type graphs
- 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
- Robustness of Erdős-Ko-Rado theorems on permutations and perfect matchings
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Stability of the independence number of G(n,r,1) graphs
- On the stability of the Erdős-Ko-Rado theorem
- Colorings of spaces, and random graphs
This page was built for publication: Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466410)
