Cover Image

Simple Chopsticks: Playing with any number of hands and fingers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dailly, Antoine, Gledel, Valentin, Nowakowski, Richard J., Santos, Carlos Pereira dos
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Affine Normal Play
by: Larsson, Urban, et al.
Published: (2024)

The balancing number and list balancing number of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On the complexity of Client-Waiter and Waiter-Client games
by: Gledel, Valentin, et al.
Published: (2024)

On the Metric Dimension of $K_a \times K_b \times K_c$
by: Gledel, Valentin, et al.
Published: (2024)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

The Closed Geodetic Game: algorithms and strategies
by: Dailly, Antoine, et al.
Published: (2024)

Positional s-of-k games
by: Duchêne, Eric, et al.
Published: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Partition games
by: Dailly, Antoine, et al.
Published: (2018)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

Resolving Sets in Temporal Graphs
by: Bok, Jan, et al.
Published: (2024)

Misère Cricket Pitch
by: Nowakowski, Richard J., et al.
Published: (2024)

Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)

A sharp upper bound for the number of connected sets in any grid graph
by: Ma, Hongxia, et al.
Published: (2025)

Cyclic impartial games with carry-on moves
by: Abuku, Tomoaki, et al.
Published: (2025)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Poset Positional Games
by: Bagan, Guillaume, et al.
Published: (2024)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)

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

On $q$-deformed Markov numbers. Cohn matrices and perfect matchings with weighted edges
by: Evans, Sam, et al.
Published: (2025)

Tree-indexed sums of Catalan numbers
by: Bostan, Alin, et al.
Published: (2025)

Large chirotopes with computable numbers of triangulations
by: Bouvel, Mathilde, et al.
Published: (2026)

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

Preorder Construct on Simple Undirected Graphs
by: Santos, Augusto Almeida, et al.
Published: (2017)

Graph with any rational density and no rich subsets of linear size
by: Im, Seonghyuk, et al.
Published: (2024)

Rainbow Turán problems for a matching and any other graph
by: Gerbner, Dániel, et al.
Published: (2025)

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

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

Canonical Ramsey numbers for partite hypergraphs
by: Carvajal, Matías Azócar, et al.
Published: (2024)

There exist infinite cube-free words over any sequence of binary alphabets
by: Bui, Vuong, et al.
Published: (2025)

Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern
by: Liu, Feihu, et al.
Published: (2026)