Sharp minimum degree conditions for the existence of disjoint theta graphs

DOI10.37236/9670zbMath1473.05247OpenAlexW3199264733MaRDI QIDQ820839

Michael Santana, Emily A. Marshall

Publication date: 28 September 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9670

zbMATH Keywords

minimum degreevertex-disjoint cyclestheta grapheven cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Disjoint chorded cycles in graphs
• Tiling Turán theorems
• Disjoint cycles and chorded cycles in a graph with given minimum degree
• Minimum degree conditions for vertex-disjoint even cycles in large graphs
• Independet cycles and chorded cycles in graphs
• On the number of independent chorded cycles in a graph
• An Ore-type Theorem for Perfect Packings in Graphs
• K₄⁻‐factor in a graph
• Vertex-disjoint copies of K₄^-
• On the maximal number of independent circuits in a graph

This page was built for publication: Sharp minimum degree conditions for the existence of disjoint theta graphs