Pages that link to "Item:Q2422241"

The following pages link to Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241):

Displaying 23 items.

• Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
• Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
• A generalization of Kneser graphs (Q2191979) (← links)
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
• New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
• 2-colorings of hypergraphs with large girth (Q2197249) (← links)
• On the independence number and the chromatic number of generalized preferential attachment models (Q2197436) (← links)
• Exact modularity of line graphs of complete graphs (Q2229338) (← links)
• New lower bound on the modularity of Johnson graphs (Q2229339) (← links)
• On stability of the independence number of a certain distance graph (Q2229578) (← links)
• Modularity of some distance graphs (Q2243703) (← links)
• New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705) (← links)
• On the chromatic number of generalized Kneser graphs and Hadamard matrices (Q2280005) (← links)
• Exact distance graphs of product graphs (Q2287747) (← links)
• Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
• On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
• On the chromatic number of generalized Kneser hypergraphs (Q2323090) (← links)
• Geodetic convexity and Kneser graphs (Q2698271) (← links)
• Large cycles in generalized Johnson graphs (Q6084722) (← links)
• On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs (Q6173476) (← links)