6 papers · 1 filter
CRIM: A Natural Game on Integer Partitions
Ina Bašić, Eric Gottlieb, Matjaž Krnc
We analyze Column-Row Impartial Merge (CRIM), an impartial combinatorial game played on integer partitions. A move in CRIM consists of removing an arbitrary row or column from the…
Sidorenko property and forcing in regular tournaments
Daniel Král', Matjaž Krnc, Filip Kučerák +2
We give a complete characterization of tournaments H that have the Sidorenko property with respect to nearly regular tournaments, i.e., the homomorphism density of H among all near…
Nim on Integer Partitions and Hyperrectangles
Eric Gottlieb, Matjaž Krnc, Peter Muršič
We describe PNim and RNim, two variants of Nim in which piles of tokens are replaced with integer partitions or hyperrectangles. In PNim, the players choose one of the integer part…
Impartial Chess on Integer Partitions
Eric Gottlieb, Matjaž Krnc, Peter Muršič
Berlekamp proposed a class of impartial combinatorial games based on the moves of chess pieces on rectangular boards. We generalize impartial chess games by playing them on Young d…
Fast recognition of some parametric graph families
Nina Klobas, Matjaž Krnc
We identify all -cycle regular -graphs and all -cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithm…
Characterization of generalized Petersen graphs that are Kronecker covers
Matjaž Krnc, Tomaž Pisanski
The family of generalized Petersen graphs , introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertice…