All Articles tagged cycles

• Hypergraphs
  July 22, 2023 EDT
  Towards a hypergraph version of the Pósa-Seymour conjecture
  Matías Pavez-SignéNicolás Sanhueza-MatamalaMaya Stein

  A minimum codegree condition for the existence of powers of tight Hamilton cycles in uniform hypergraphs.

  Editorial introduction
• Structural graph theory
  June 01, 2022 EDT
  Leaper Tours
  Nikolai Beluhov

  Generalized knights can tour chessboards of any sufficiently large size, provided a simple set of necessary obstructions is excluded.

  Editorial introduction
• Structural graph theory
  February 03, 2021 EDT
  Cycle lengths modulo k in large 3-connected cubic graphs
  Kasper S. LyngsieMartin Merker

  For every integer m and every positive odd integer k, every sufficiently large 3-connected cubic graph contains a cycle of length m modulo k.

  Editorial introduction