The following pages link to (Q3464534):
Displayed 50 items.
- 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)
- Turán type results for distance graphs (Q331389) (← links)
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← 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 the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- On threshold probabilities for the realization of a random graph by a geometric graph (Q892733) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- On the stability of the independence number of a random subgraph (Q1707163) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- Spectrum of Johnson graphs (Q2111919) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← 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)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- On dividing sets into parts of smaller diameter (Q2243826) (← 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)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- Clique chromatic numbers of intersection graphs (Q2313617) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- Clique numbers of random subgraphs of some distance graphs (Q2314150) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- On simplices in diameter graphs in \(\mathbb{R}^4\) (Q2396420) (← links)
- Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792) (← links)
- Turán-type bounds for distance graphs (Q2411797) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- (Q5239647) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)