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 6322
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
15
votes
Combinatorial databases
Not related to polyominos, but I like House of Graphs: https://houseofgraphs.org
It allows you to search by graph6 code, so if you find an interesting graph, you can check whether that graph has arise …
12
votes
Accepted
Blinking graphs
This question seems quite similar to the problem of parity domination. Let $S$ be the set of vertices with label $1$. The condition that $S$ flips to its complement after updating is equivalent to the …
- 681
9
votes
Accepted
What is the correct statement of this Erdös-Gallai-Tuza problem generalizing Turan's triangl...
I hope I am not violating any kind of MathOverflow etiquette by responding to a question 2 years after it has been asked, but your question is answered in the following preprint of mine that just hit …
- 681
8
votes
Accepted
How many uniquely colored degree two vertices in 3-coloring of subcubic graph?
No such graph exists (that is, you cannot have a subcubic graph with three degree-$2$ vertices all forced to the same color). Suppose that such a graph exists; we may assume the graph is connected. Th …
- 681
5
votes
Accepted
List chromatic index of a particular graph
Greedy coloring works here to show $2p$-choosability, I believe, and the hypothesis that $p$ is prime doesn't appear to be necessary. Write the cliques as $A = \{a_1, \ldots, a_{p+1}\}$ and $B = \{b_1 …
- 681