J 2010

Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs

KRÁĽ, Daniel; E MACAJOVA; A POR a JS SERENI

Základní údaje

Originální název

Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs

Autoři

KRÁĽ, Daniel; E MACAJOVA; A POR a JS SERENI

Vydání

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, OTTAWA, CANADIAN MATHEMATICAL SOCIETY, 2010, 0008-414X

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Utajení

není předmětem státního či obchodního tajemství

Impakt faktor

Impact factor: 0.776

Označené pro přenos do RIV

Ne
Změněno: 6. 11. 2020 09:36, Mgr. Darina Boukalová

Anotace

V originále

It is known that a Steiner triple system is projective if and only if it does not contain the four-triple configuration C-14. We find three configurations such that a Steiner triple system is affine if and only if it does not contain one of these configurations. Similarly, we characterise Hall triple systems using two forbidden configurations. Our characterisations have several interesting corollaries in the area of edge-colourings of graphs. A cubic graph G is S-edge-colourable for a Steiner triple system S if its edges can be coloured with points of S in such a way that the points assigned to three edges sharing a vertex form a triple in S. Among others, we show that all cubic graphs are S-edge-colourable for every non-projective non-affine point-transitive Steiner triple system S.