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 5513
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
Acyclicity equivalent to unique paths
I think the most straightforward generalization would be to algebraic topology. The analogue to acyclicity is the property of being simply connected, and uniqueness of a path between two vertices beco …
- 4,790
14
votes
Accepted
Does a graph with all vertex degrees divisible by 3 contain a cubic subgraph?
Counterexample:
alt text http://www.freeimagehosting.net/newuploads/8m77r.png
- 4,790