Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 57145
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
11
votes
Accepted
Looking for history on a theorem of clique intersections
Hajnal's Clique Collection Lemma implies your theorem. See Corollary 2.10 from this paper http://arxiv.org/pdf/1101.4564v5.pdf or Hajnal's original paper http://cms.math.ca/cjm/v17/cjm1965v17.0720-072 …
- 356
27
votes
Generalizations of the four-color theorem
Here are two:
Recall that the four colour theorem is equivalent to the statement that bridgeless cubic planar graphs are three-edge-colourable.
There is Tutte’s three-edge-colouring conjecture that …