Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/118840
Title: | An equivalent formulation of the Fan-Raspaud Conjecture and related problems |
Authors: | Mazzuoccolo, Giuseppe Zerafa, Jean Paul |
Keywords: | Graph theory Graphic methods Mathematics -- Charts, diagrams, etc. Perfect numbers |
Issue Date: | 2018 |
Publisher: | Drustvo Matematikov, Fizikov in Astronomov |
Citation: | Mazzuoccolo, G., & Zerafa, J. P. (2018). An equivalent formulation of the Fan-Raspaud Conjecture and related problems. Ars Mathematica Contemporanea, 18, 87-103. |
Abstract: | In 1994, it was conjectured by Fan and Raspaud that every simple bridgeless cubic graph has three perfect matchings whose intersection is empty. In this paper we answer a question recently proposed by Mkrtchyan and Vardanyan, by giving an equivalent formulation of the Fan-Raspaud Conjecture. We also study a possibly weaker conjecture originally proposed by the first author, which states that in every simple bridgeless cubic graph there exist two perfect matchings such that the complement of their union is a bipartite graph. Here, we show that this conjecture can be equivalently stated using a variant of Petersen-colourings, we prove it for graphs having oddness at most four and we give a natural extension to bridgeless cubic multigraphs and to certain cubic graphs having bridges. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/118840 |
Appears in Collections: | Scholarly Works - FacEduTEE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
An_equivalent_formulation_of_the_Fan_Raspaud_Conjecture_and_related_problems_2018.pdf | 325.84 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.