The smallest nonevasive graph property

DOI10.7151/dmgt.1766zbMath1303.05126arXiv1303.5601OpenAlexW2964299274MaRDI QIDQ472145

Michał Adamaszek

Publication date: 18 November 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.5601

zbMATH Keywords

complexityevasivenessgraph properties

Mathematics Subject Classification ID

Discrete-time games (91A50) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (05C99) Games on graphs (graph-theoretic aspects) (05C57)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• A topological approach to evasiveness
• Constructions preserving evasiveness and collapsibility
• The On-Line Encyclopedia of Integer Sequences
• A course in topological combinatorics
• Combinatorial algebraic topology

This page was built for publication: The smallest nonevasive graph property