| Display title | Symmetric hypergraph theorem |
| Default sort key | Symmetric hypergraph theorem |
| Page length (in bytes) | 1,745 |
| Namespace ID | 0 |
| Page ID | 5514192 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Wikidata item ID | Q7661308 |
| Central description | theorem that puts an upper bound on the chromatic number of a hypergraph |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | RobertBorgersen (talk | contribs) |
| Date of page creation | 04:27, 11 June 2006 |
| Latest editor | Dexxor (talk | contribs) |
| Date of latest edit | 15:28, 21 September 2024 |
| Total number of edits | 30 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (3) | This page is a member of 3 hidden categories (help):
|
| Transcluded templates (30) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
