Estimate of the number of edges in special subgraphs of a distance graph

Cites work

scientific article; zbMATH DE number 6536189 (Why is no real title available?)
scientific article; zbMATH DE number 3700716 (Why is no real title available?)
scientific article; zbMATH DE number 46958 (Why is no real title available?)
scientific article; zbMATH DE number 51916 (Why is no real title available?)
scientific article; zbMATH DE number 3458659 (Why is no real title available?)
scientific article; zbMATH DE number 1017008 (Why is no real title available?)
scientific article; zbMATH DE number 1943977 (Why is no real title available?)
A new estimate for the number of edges in induced subgraphs of a special distance graph
A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
Around Borsuk's hypothesis
Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
Borsuk's problem and the chromatic numbers of some metric spaces
Clique chromatic numbers of intersection graphs
Codes with forbidden distances
Coloring distance graphs and graphs of diameters
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
Coloring some finite sets in \(\mathbb R^n\)
Combinatorial geometry and coding theory
Counterexamples to Borsuk's conjecture with large girth
Embedding graphs in Euclidean space
Excursions into combinatorial geometry
Exponentially Ramsey sets
Improved Frankl-Rödl theorem and some of its geometric consequences
Improvements of the Frankl-Rödl theorem and geometric consequences
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
Number of nonzero cubic sums
On a bound in extremal combinatorics
On chromatic numbers of nearly Kneser distance graphs
On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
On the Frankl-Rödl theorem
On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
On the chromatic number of a random subgraph of the Kneser graph
On the chromatic number of a space with a forbidden regular simplex
On the chromatic numbers of low-dimensional spaces
On the chromatic numbers of some distance graphs
On the chromatic numbers of spheres in Euclidean spaces
On the chromatic numbers of spheres in \(\mathbb R^n\)
On the distance and multidistance graph embeddability problem
On the maximal number of edges in a uniform hypergraph with one forbidden intersection
On the number of edges in a uniform hypergraph with a range of permitted intersections
On the number of edges in induced subgraphs of a special distance graph
On the number of edges of a uniform hypergraph with a range of allowed intersections
On the stability of the independence number of a random subgraph
Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
The Mathematical Coloring Book
The number of edges in induced subgraphs of some distance graphs
Three lectures on the Borsuk partition problem
Turán type results for distance graphs
Turán-type bounds for distance graphs
Turán-type results for distance graphs in an infinitesimal plane layer

Cited in

(12)

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)\)
Lower bound on the minimum number of edges in subgraphs of Johnson graphs
On the number of edges in induced subgraphs of a special distance graph
On Ramsey numbers for arbitrary sequences of graphs
Chromatic numbers of distance graphs without short odd cycles in rational spaces
Bounds on Borsuk numbers in distance graphs of a special type
On dividing sets into parts of smaller diameter
Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
Estimates of the Number of Edges in Subgraphs of Johnson Graphs
Estimate of the number of edges in subgraphs of a Johnson graph
On the minimal number of edges in induced subgraphs of special distance graphs

This page was built for publication: Estimate of the number of edges in special subgraphs of a distance graph

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