The following pages link to (Q4410025):
Displaying 50 items.
- Better bounds for planar sets avoiding unit distances (Q282753) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- Independence numbers of random subgraphs of a distance graph (Q296011) (← links)
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- A new estimate for the number of edges in induced subgraphs of a special distance graph (Q327309) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- 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 (Q492207) (← links)
- On a generalization of the Hadwiger-Nelson problem (Q522309) (← links)
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\) (Q604438) (← links)
- On the chromatic number of with an arbitrary norm (Q626862) (← links)
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance (Q679870) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- On threshold probabilities for the realization of a random graph by a geometric graph (Q892733) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- Patch colorings and rigid colorings of the rational \(n\)-space (Q1850575) (← links)
- Chromatic numbers of spaces with forbidden monochromatic triangles (Q1947779) (← links)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
- A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture (Q1991086) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Density estimates of 1-avoiding sets via higher order correlations (Q2136845) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Polynomial configurations in sets of positive upper density over local fields (Q2227134) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- One problem on geometric Ramsey numbers (Q2258893) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- On the density of sets avoiding parallelohedron distance 1 (Q2324626) (← links)
- 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 (Q2342346) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- New lower bound for the chromatic number of a rational space with one and two forbidden distances (Q2353733) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- On the chromatic number for a set of metric spaces (Q2435955) (← links)
- 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 (Q2452861) (← links)
- On the Borsuk and Erdős-Hadwiger numbers (Q2473700) (← links)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances (Q2473753) (← links)
- Chromatic numbers of metric spaces (Q2519262) (← links)
- Erdős’s Unit Distance Problem (Q2827300) (← links)
- Small clique and large chromatic number (Q2851500) (← links)
- Borsuk's problem and the chromatic numbers of metric spaces (Q3439594) (← links)
