Marcin Stawiski

collaborators

5 papers

math.CO2026

Breaking small automorphisms of graphs of arbitrary cardinality

Marcin Stawiski

We say that an edge colouring $c$ of a graph preserves an automorphism $I ¨ $ if $I ¨ $ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $I ¨ $ . We call an…

math.CO2026

Irreducible distinguishing colourings and the Axiom of Choice

Marcin Stawiski

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is i…

math.CO2026

A new problem related to Eulerian graphs

Marcin Stawiski

Let $G$ be a graph, and $H$ be a finite subgraph of $G$ . We say that $H$ is a (semi) $S$ -Eulerian subgraph if there exists a closed (open) trail $T$ in $G$ such that each edge of $…

math.CO2025

Distinguishing finite and infinite trees of arbitrary cardinality

Wilfried Imrich, RafaÅ Kalinowski, Florian Lehner +2

Let $G$ be a finite or infinite graph and $m (G)$ the minimum number of vertices moved by the non-identity automorphisms of $G$ . We are interested in bounds on the supremum $I^ (G)$ …

math.CO2025

Distinguishing regular graphs from lists

Jakub KwaÅny, Marcin Stawiski

An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connect…