From One to Many Rainbow Hamiltonian Cycles

@article{Bradshaw2021FromOT,
  title={From One to Many Rainbow Hamiltonian Cycles},
  author={Peter Bradshaw and Kevin Halasz and Ladislav Stacho},
  journal={Graphs and Combinatorics},
  year={2021},
  volume={38}
}
Given a graph G and a family G={G1,…,Gn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {G} = \{G_1,\ldots ,G_n\}$$\end{document} of subgraphs of G, a transversal of G\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy… 

Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs

. Given a family of graphs G 1 , . . . , G n on the same vertex set [ n ], a rainbow Hamilton cycle is a Hamilton cycle on [ n ] such that each G i contributes exactly one edge. We prove that if G 1

References

SHOWING 1-10 OF 36 REFERENCES

Additive triples of bijections, or the toroidal semiqueens problem

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon

Transversals and Bipancyclicity in Bipartite Graph Families

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n

Representation of Large Matchings in Bipartite Graphs

It is shown that the $o(n)$ term can be reduced to a constant, namely $f (n) \le \lceil \frac{3}{2}n \rceil+1$.

A rainbow version of Mantel's Theorem

Mantel's Theorem from 1907 is one of the oldest results in graph theory: every simple $n$-vertex graph with more than $\frac{1}{4}n^2$ edges contains a triangle. The theorem has been generalized in

Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs

The minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-uniform hypergraph without an isolated vertex is determined and the (unique) extremal hyergraph is a different space barrier from the one for the corresponding Dirac problem.

Hamiltonian cycles in Dirac graphs

It is proved that for any n-vertex Dirac graph G=(V,E), the number, Ψ(G), of Hamiltonian cycles in G is at least exp_2, where h(G) =maxΣexe log(1/xe), the maximum over x: E → ℜ+ satisfying Σe∋υxe = 1 for each υ ∈ V, and log =log2.

On a rainbow version of Dirac's theorem

For a collection G={G1,⋯,Gs} of not necessarily distinct graphs on the same vertex set V , a graph H with vertices in V is a G ‐transversal if there exists a bijection ϕ:E(H)→[s] such that e∈E(Gϕ(e))

Regular Graphs with Few Longest Cycles

Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constant c such that there is an infinite family of 4-regular 4-connected graphs, each containing exactly

Perfect matchings in large uniform hypergraphs with large minimum collective degree