Marcin Stawiski

activity

20182021

collaborators

5 papers

math.CO2021

Factorizations of regular graphs of infinite degree

Marcin Stawiski

Let $H = {H_{i} : i < α}$ be an indexed family of graphs for some ordinal number $α$ . $H$ -decomposition of a graph $G$ is a family $G = {G_{i} : i < α}$ of edge…

math.CO2021

Distinguishing infinite star-free graphs

Marcin Stawiski

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that…

math.CO2019

On asymmetric colourings of graphs with bounded degrees and infinite motion

Florian Lehner, Monika Pilśniak, Marcin Stawiski

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locall…

math.CO2019

A bound for the distinguishing index of regular graphs

Florian Lehner, Monika Pilśniak, Marcin Stawiski

An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected…

math.CO2018

Distinguishing infinite graphs with bounded degrees

Florian Lehner, Monika Pilśniak, Marcin Stawiski

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ move…