Skip to main content
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
Search options not deleted user 119114

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
92 views

Minesweeper constructions in combinatorics

In a related question I asked if constructions based on Sudoku puzzles could be used to obtain any deep results in combinatorics and noted that there were papers of Greenfeld and Tao where Sudoku cons …
Hollis Williams's user avatar
5 votes
0 answers
206 views

Are there Sudoku variants which are useful or mathematically deep?

I was recently watching a Sudoku Youtube channel which shows a large number of variants on the traditional Sudoku puzzle, some of them non-trivial to solve. I think there was some mention of a Sudoku …
Hollis Williams's user avatar
3 votes
1 answer
276 views

Game theory approach to Trans Europa

The other day I was playing a game called Trans Europa (or Trans America) which is quite graph theoretic in flavour. The game takes place on a triangular lattice graph with certain distinguished node …
Hollis Williams's user avatar