scientific article; zbMATH DE number 1943977
From MaRDI portal
Publication:4410025
Recommendations
- Some notes on the Erdős-Szekeres theorem
- scientific article; zbMATH DE number 4177148
- Erdős-Turán inequalities for distance functions on spheres
- On Erdős-Szekeres-type problems
- Erdős’s Unit Distance Problem
- scientific article; zbMATH DE number 468661
- On a problem of Erdős and Szemerédi
- On the Erdős-Fuchs theorem
- On a Theorem of Erdos and Turan
- On a theorem of Erdős and Sárközy
Cited in
(58)- Diameters of random distance graphs
- Patch colorings and rigid colorings of the rational \(n\)-space
- Chromatic numbers of spaces with forbidden monochromatic triangles
- On distance subgraphs of graphs in spaces of lower dimensions
- A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture
- Complete positivity and distance-avoiding sets
- Density estimates of 1-avoiding sets via higher order correlations
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Polynomial configurations in sets of positive upper density over local fields
- On stability of the independence number of a certain distance graph
- One problem on geometric Ramsey numbers
- Exponentially Ramsey sets
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- On threshold probability for the stability of independent sets in distance graphs
- On lower bounds for the chromatic number of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- The number of edges in induced subgraphs of some distance graphs
- On the density of sets avoiding parallelohedron distance 1
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- On the chromatic number for a set of metric spaces
- 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 Borsuk and Erdős-Hadwiger numbers
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Chromatic numbers of metric spaces
- Erdős’s Unit Distance Problem
- Better bounds for planar sets avoiding unit distances
- Small clique and large chromatic number
- On large subgraphs with small chromatic numbers contained in distance graphs
- Independence numbers of random subgraphs of a distance graph
- Density version of a theorem of Beck and Szemerédi-Trotter in combinatorial geometry
- On the number of edges in induced subgraphs of a special distance graph
- Independence numbers of random subgraphs of distance graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Borsuk's problem and the chromatic numbers of metric spaces
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- An incidence theorem in higher dimensions
- On the chromatic number of an infinitesimal plane layer
- Ruled surface theory and incidence geometry
- Spectral bounds for the independence ratio and the chromatic number of an operator
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- On the density of sets of the Euclidean plane avoiding distance 1
- On a generalization of the Hadwiger-Nelson problem
- On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- Measurable sets with excluded distances
- Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
- On the chromatic number of with an arbitrary norm
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance
- Hamiltonian paths in distance graphs
- On threshold probabilities for the realization of a random graph by a geometric graph
- Colorings of spaces, and random graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410025)
