From one to many rainbow Hamiltonian cycles (Q2102759)

From MaRDI portal
scientific article
Language Label Description Also known as
English
From one to many rainbow Hamiltonian cycles
scientific article

    Statements

    From one to many rainbow Hamiltonian cycles (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2022
    0 references
    Given a graph \(G\) and a family \(\mathcal{G} = \{ G_1, \dots , G_n \}\) of subgraphs of \(G\), a transversal of \(\mathcal{G}\) is a pair \((T,\phi)\) such that \(T \subseteq E(G)\) and \(\phi : T \rightarrow [n]\) is a bijection satisfying \(e \in G_{\phi(e)}\) for each \(e \in T\). Informally, a transversal is a set of edges that uses exactly one edge from each subgraph \(G_i \in \mathcal{G}\). A transversal \((T,\phi)\) is called a Hamiltonian transversal of \(\mathcal{G}\) if \(T\) corresponds to the edge set of a Hamiltonian cycle of \(G\). \textit{F. Joos} and \textit{J. Kim} [Bull. Lond. Math. Soc. 52, No. 3, 498--504 (2020; Zbl 1444.05078)] proved that if \(G=K_n\) and \(\mathcal{G} = \{ G_1, \dots , G_n \}\) satisfies \(\delta(G_i) \geq n/2\) for each \(i \in [n]\), then there exists a Hamiltonian transversal of \(\mathcal{G}\). This generalizes Dirac's classic sufficient minimum degree condition [\textit{G. A. Dirac}, Proc. Lond. Math. Soc. (3) 2, 69--81 (1952; Zbl 0047.17001)] for a Hamiltonian cycle. Similarly, the first author showed in [``An asymptotic for the Hall-Paige conjecture'', Preprint, \url{arXiv:2003.01798}] that a similar condition of \textit{J. Moon} and \textit{L. Moser} [Isr. J. Math. 1, 163--165 (1963; Zbl 0119.38806)] for Hamiltonicity in bipartite graphs can be generalized into the setting of transversals. This paper continues the project of generalizing results related to Hamiltonicity into the language of graph transversals. For example, the authors show that under certain conditions on the maximum degree of \(G\) and the minimum degrees of \(G_i \in \mathcal{G}\), for every \(\mathcal{G}\) which contains a Hamiltonian transversal, the number of Hamiltonian transversals of \(\mathcal{G}\) is bounded below by a function of the maximum degree of \(G\). This generalizes a theorem of [\textit{C. Thomassen}, J. Comb. Theory, Ser. B 72, No. 1, 104--109 (1998; Zbl 0895.05038)] stating that, for \(m \geq 300\), no \(m\)-regular graph is uniquely Hamiltonian.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph transversal
    0 references
    Hamiltonian properties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references