Pages that link to "Item:Q4976403"

The following pages link to Combinatorial Geometry and Coding Theory* (Q4976403):

Displaying 33 items.

• Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
• On the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
• On the chromatic number of a random subgraph of the Kneser graph (Q679977) (← links)
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
• On the stability of the independence number of a random subgraph (Q1707163) (← links)
• On the chromatic numbers of some distance graphs (Q1709876) (← links)
• Chromatic numbers of spheres (Q1783626) (← links)
• On a relation between packing and covering densities of convex bodies (Q2022613) (← links)
• Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
• On Ramsey numbers for arbitrary sequences of graphs (Q2145747) (← links)
• Independence numbers of random subgraphs of some distance graph (Q2190887) (← links)
• On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← 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)
• A generalization of Kneser graphs (Q2191979) (← links)
• On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← 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)
• Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← 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)
• 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)
• 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)
• Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
• Large cycles in generalized Johnson graphs (Q6084722) (← links)