Image de couverture de livre

Simple Chopsticks: Playing with any number of hands and fingers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dailly, Antoine, Gledel, Valentin, Nowakowski, Richard J., Santos, Carlos Pereira dos
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A generalization of Arc-Kayles
par: Dailly, Antoine, et autres
Publié: (2017)

Affine Normal Play
par: Larsson, Urban, et autres
Publié: (2024)

The balancing number and list balancing number of some graph classes
par: Dailly, Antoine, et autres
Publié: (2020)

The Avoider-Enforcer game on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2025)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

On the complexity of Client-Waiter and Waiter-Client games
par: Gledel, Valentin, et autres
Publié: (2024)

On the Metric Dimension of $K_a \times K_b \times K_c$
par: Gledel, Valentin, et autres
Publié: (2024)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
par: Burke, Kyle, et autres
Publié: (2024)

Algorithms and hardness for Metric Dimension on digraphs
par: Dailly, Antoine, et autres
Publié: (2023)

Connected Subtraction Games on Subdivided Stars
par: Dailly, Antoine, et autres
Publié: (2018)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
par: Dailly, Antoine, et autres
Publié: (2018)

On the balanceability of some graph classes
par: Dailly, Antoine, et autres
Publié: (2020)

The Closed Geodetic Game: algorithms and strategies
par: Dailly, Antoine, et autres
Publié: (2024)

Positional s-of-k games
par: Duchêne, Eric, et autres
Publié: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
par: Dailly, Antoine, et autres
Publié: (2022)

Partition games
par: Dailly, Antoine, et autres
Publié: (2018)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
par: Chakraborty, Dibyayan, et autres
Publié: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
par: Dailly, Antoine, et autres
Publié: (2025)

A Vizing-like theorem for union vertex-distinguishing edge coloring
par: Bousquet, Nicolas, et autres
Publié: (2016)

Resolving Sets in Temporal Graphs
par: Bok, Jan, et autres
Publié: (2024)

Misère Cricket Pitch
par: Nowakowski, Richard J., et autres
Publié: (2024)

Partition strategies for the Maker-Breaker domination game
par: Bagan, Guillaume, et autres
Publié: (2024)

A sharp upper bound for the number of connected sets in any grid graph
par: Ma, Hongxia, et autres
Publié: (2025)

Cyclic impartial games with carry-on moves
par: Abuku, Tomoaki, et autres
Publié: (2025)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
par: Beaudou, Laurent, et autres
Publié: (2016)

Poset Positional Games
par: Bagan, Guillaume, et autres
Publié: (2024)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
par: Abiad, Aida, et autres
Publié: (2026)

On the domination number of the cartesian product of the path graph and any pair of graphs
par: Tout, Omar
Publié: (2023)

On $q$-deformed Markov numbers. Cohn matrices and perfect matchings with weighted edges
par: Evans, Sam, et autres
Publié: (2025)

Tree-indexed sums of Catalan numbers
par: Bostan, Alin, et autres
Publié: (2025)

Large chirotopes with computable numbers of triangulations
par: Bouvel, Mathilde, et autres
Publié: (2026)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
par: Bonte, Sébastien, et autres
Publié: (2025)

Preorder Construct on Simple Undirected Graphs
par: Santos, Augusto Almeida, et autres
Publié: (2017)

Graph with any rational density and no rich subsets of linear size
par: Im, Seonghyuk, et autres
Publié: (2024)

Rainbow Turán problems for a matching and any other graph
par: Gerbner, Dániel, et autres
Publié: (2025)

Constructions of graphs with any possible two-fold automorphism and automorphism groups
par: Bychawski, Bartłomiej
Publié: (2024)

Combinatorial Göttsche-Schroeter invariants in any genus
par: Mével, Gurvan
Publié: (2024)

Canonical Ramsey numbers for partite hypergraphs
par: Carvajal, Matías Azócar, et autres
Publié: (2024)

There exist infinite cube-free words over any sequence of binary alphabets
par: Bui, Vuong, et autres
Publié: (2025)

Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern
par: Liu, Feihu, et autres
Publié: (2026)