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 161863
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
6
votes
1
answer
178
views
On a limit involving a transform of the chromatic polynomial
I was playing around with the chromatic polynomial (denoted here by $\chi_G(x)$) and I have made the following conjecture.
Let $(G_n)_{n \ge 1}$ be a sequence of graphs with $v(G_n) \to \infty$ ($v(G_ …
- 93
3
votes
0
answers
76
views
Littlewood Offord for odd number of real numbers
One version of the Littlewood-Offord problem states that if $a_1, \ldots, a_n$ are real numbers with absolute value at least $1$, then the number of sequences $\varepsilon_1, \ldots, \varepsilon_n$ wi …
- 93