Thomassen’s conjecture for line graphs of 3-hypergraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43957823" target="_blank" >RIV/49777513:23520/20:43957823 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0012365X20300297?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0012365X20300297?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2020.111838" target="_blank" >10.1016/j.disc.2020.111838</a>
Alternative languages
Result language
angličtina
Original language name
Thomassen’s conjecture for line graphs of 3-hypergraphs
Original language description
In 1986, Thomassen conjectured that every 4-connected line graph is hamiltonian. The conjecture is still wide open, and, as a possible approach to it, many statements that are equivalent or related to it have been studied. In this paper, we extend the statement to the class of line graphs of 3-hypergraphs, and generalize it to Tutte cycles and paths. Among others, we formulate the following conjectures: (i) every 2-connected line graph of a 3-hypergraph has a Tutte maximal cycle containing any two prescribed vertices, (ii) every 3-connected line graph of a 3-hypergraph has a Tutte maximal cycle containing any three prescribed vertices, (iii) every connected line graph of a 3-hypergraph has a Tutte maximal (a, b)-path for any two vertices a, b, (iv) every 4-connected line graph of a 3-hypergraph is Hamilton-connected, and we show that all these (seemingly much stronger) statements are equivalent with Thomassen’s conjecture.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
DISCRETE MATHEMATICS
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
343
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
18
Pages from-to
—
UT code for WoS article
000528203800018
EID of the result in the Scopus database
2-s2.0-85079170994