EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C57 Games on graphs

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 2 of 2

The first player wins the one-colour triangle avoidance game on 16 vertices

Przemysław Gordinowicz, Paweł Prałat (2012)

Discussiones Mathematicae Graph Theory

We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.

The $t$ -pebbling number is eventually linear in $t$ .

Hoffmann, Michael, Matoušek, Jiří, Okamoto, Yoshio, Zumstein, Philipp (2011)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 1 – 2 of 2

Page 1

Displaying 1 – 2 of 2

The first player wins the one-colour triangle avoidance game on 16 vertices

The t -pebbling number is eventually linear in t .

Currently displaying 1 – 2 of 2

The $t$ -pebbling number is eventually linear in $t$ .