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 56094
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
0
votes
0
answers
86
views
Necessary Conditions for a Graph not possible to Rainbow Color?
Suppose we have a $t$-uniform hypergraph ($t \ge 3$) $G$, and have $t$ colors available. A question in my research is equivalent to asking what the necessary and sufficient conditions are on $G$ for w …
- 103
0
votes
0
answers
673
views
Counting Non-Isomorphic Connected Spanning Graphs on n vertices, m edges
There have been many questions on this site about counting non-isormorphic graphs that are (1) strongly regular, (2) have a certain chromatic number, (3) connected, among many others.
What work has b …
- 103