575 research outputs found
Positional Games
Positional games are a branch of combinatorics, researching a variety of
two-player games, ranging from popular recreational games such as Tic-Tac-Toe
and Hex, to purely abstract games played on graphs and hypergraphs. It is
closely connected to many other combinatorial disciplines such as Ramsey
theory, extremal graph and set theory, probabilistic combinatorics, and to
computer science. We survey the basic notions of the field, its approaches and
tools, as well as numerous recent advances, standing open problems and
promising research directions.Comment: Submitted to Proceedings of the ICM 201
A proof of Waldhausen's uniqueness of splittings of S^3 (after Rubinstein and Scharlemann)
In [Topology 35 (1996) 1005--1023] J H Rubinstein and M Scharlemann, using
Cerf Theory, developed tools for comparing Heegaard splittings of irreducible,
non-Haken manifolds. As a corollary of their work they obtained a new proof of
Waldhausen's uniqueness of Heegaard splittings of S^3. In this note we use Cerf
Theory and develop the tools needed for comparing Heegaard splittings of S^3.
This allows us to use Rubinstein and Scharlemann's philosophy and obtain a
simpler proof of Waldhausen's Theorem. The combinatorics we use are very
similar to the game Hex and requires that Hex has a winner. The paper includes
a proof of that fact (Proposition 3.6).Comment: This is the version published by Geometry & Topology Monographs on 3
December 200
On a class of hyperplanes of the symplectic and Hermitian dual polar spaces.
Let be a symplectic dual polar space (2n-1,K), \geq 2\Delta arising from its Grassmann-embedding if and only if there exists an empty \PG(n-1,K)$. Using this result we are able to give the first examples of ovoids in thick dual polar spaces of rank at least 3 which arise from some projective embedding. These are also the first examples of ovoids in thick dual polar spaces of rank at least 3 for which the construction does not make use of transfinite recursion
Strategy-Stealing Is Non-Constructive
In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually find a winning move in a game, when you know by strategy-stealing that one exists? We prove that this problem is PSPACE-Complete already for Minimum Poset Games and Symmetric Maker-Maker Games, which are simple classes of games that capture two of the main types of strategy-stealing arguments in the current literature
Defective and Clustered Graph Colouring
Consider the following two ways to colour the vertices of a graph where the
requirement that adjacent vertices get distinct colours is relaxed. A colouring
has "defect" if each monochromatic component has maximum degree at most
. A colouring has "clustering" if each monochromatic component has at
most vertices. This paper surveys research on these types of colourings,
where the first priority is to minimise the number of colours, with small
defect or small clustering as a secondary goal. List colouring variants are
also considered. The following graph classes are studied: outerplanar graphs,
planar graphs, graphs embeddable in surfaces, graphs with given maximum degree,
graphs with given maximum average degree, graphs excluding a given subgraph,
graphs with linear crossing number, linklessly or knotlessly embeddable graphs,
graphs with given Colin de Verdi\`ere parameter, graphs with given
circumference, graphs excluding a fixed graph as an immersion, graphs with
given thickness, graphs with given stack- or queue-number, graphs excluding
as a minor, graphs excluding as a minor, and graphs excluding
an arbitrary graph as a minor. Several open problems are discussed.Comment: This is a preliminary version of a dynamic survey to be published in
the Electronic Journal of Combinatoric
- …