Transversal $C_k$-factors in subgraphs of the balanced blow-up of $C_k$
Beka Ergemlidze, Theodore Molla

TL;DR
This paper proves an asymptotic version of a conjecture on the existence of disjoint $C_k$-factors in subgraphs of balanced blow-ups of cycles, extending previous results and proposing a generalized conjecture.
Contribution
It proves the conjecture asymptotically for general $k$ and supports a new generalized conjecture with variable degree conditions.
Findings
Confirmed the conjecture asymptotically for all $k$
Proved the triangle case supporting the generalized conjecture
Extended Johansson's asymptotic results to larger cycles
Abstract
For a subgraph of the blow-up of a graph , we let be the smallest minimum degree over all of the bipartite subgraphs of induced by pairs of parts that correspond to edges of . In [Triangle-factors in a balanced blown-up triangle. Discrete Mathematics, 2000], Johansson proved that if is a spanning subgraph of the blow-up of with parts of size and , then contains vertex-disjoint triangles, and presented the following conjecture of H\"aggkvist: If is a spanning subgraph of the blow-up of with parts of size and , then contains vertex disjoint copies of such that each intersects each of the parts exactly once. The degree condition of this conjecture is tight when and cannot be strengthened by more than one when ., A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · graph theory and CDMA systems
