Pages that link to "Item:Q2342346"

The following pages link to 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):

Displaying 9 items.

• 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)
• An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
• On the chromatic numbers of some distance graphs (Q1709876) (← links)
• On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
• A generalization of Kneser graphs (Q2191979) (← links)
• On lower bounds for the chromatic number of spheres (Q2313602) (← links)
• Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
• Intersection theorems for \((- 1, 0, 1)\)-vectors (Q6181997) (← links)