Skip to search formSkip to main contentSkip to account menu

Symmetric hypergraph theorem

The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Graph (discrete mathematics)Graph coloring

Search for papers about Symmetric hypergraph theorem

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)