Pages that link to "Item:Q2191968"

The following pages link to Estimate of the number of edges in special subgraphs of a distance graph (Q2191968):

Displaying 10 items.

• 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)
• On Ramsey numbers for arbitrary sequences of graphs (Q2145747) (← links)
• On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
• On stability of the independence number of a certain distance graph (Q2229578) (← links)
• On dividing sets into parts of smaller diameter (Q2243826) (← links)
• Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) (Q2246874) (← links)
• Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs (Q6173476) (← links)
• Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)