2 problems

The poset tournament rebel conjecture
A tournament $R$ is a rebel if the class of tournaments not containing $R$ has bounded domination number. A poset tournament is a tournament admitting an ordering whose backedge gr…
opencomparability-graphs domination-number tournaments
0 responses
05
The permutation-representation conjecture for comparability graphs
Let $G$ be a comparability graph, meaning the graph of a partial order. Write $\mathcal{R}_2$ for the class of graphs with representation number at most two, and…
opencomparability-graphs permutation-representations word-representable-graphs
0 responses
06

The poset tournament rebel conjecture