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 84494
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
19
votes
A chess question of W.T. Tutte
In the German chess problem magazine feenschach, Heft 214 Band XXIV, July-August 2015 pp 178-180, I pose & solve the following mathematical puzzle: "Consider the 25 chess positions deriving from the 2 …
- 333
4
votes
Can every involution of a symmetric directed graph be written as a power of another symmetry?
This answer builds upon Sam Hopkins' suggestion of an oriented toroidal grid, but it's more than a comment. Bottom line: need the grid to be $2^s$ by $2^s$ where $s\ge2$ to get the requested involutio …
- 333