Pages that link to "Item:Q331389"
From MaRDI portal
The following pages link to Turán type results for distance graphs (Q331389):
Displaying 14 items.
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- On the stability of the independence number of a random subgraph (Q1707163) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems (Q2039318) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← 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)
- Turán-type bounds for distance graphs (Q2411797) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- Small unit-distance graphs in the plane (Q3387180) (← links)
- Interview with Andrei Raigorodskii (Q6097078) (← links)
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems (Q6621192) (← links)
