DeepAI AI Chat
Log In Sign Up

Longest Cycle above Erdős-Gallai Bound

02/07/2022
by   Fedor V. Fomin, et al.
University of Bergen
0

In 1959, Erdős and Gallai proved that every graph G with average vertex degree ad(G)≥2 contains a cycle of length at least ad(G). We provide an algorithm that for k≥0 in time 2^O(k) n^O(1) decides whether a 2-connected n-vertex graph G contains a cycle of length at least ad(G)+k. This resolves an open problem explicitly mentioned in several papers. The main ingredients of our algorithm are new graph-theoretical results interesting on their own.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/06/2020

Algorithmic Extensions of Dirac's Theorem

In 1952, Dirac proved the following theorem about long cycles in graphs ...
10/16/2017

Longer Cycles in Essentially 4-Connected Planar Graphs

A planar 3-connected graph G is called essentially 4-connected if, for e...
02/07/2019

Going Far From Degeneracy

An undirected graph G is d-degenerate if every subgraph of G has a verte...
06/25/2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs

A planar graph is essentially 4-connected if it is 3-connected and every...
12/12/2022

Aharoni's rainbow cycle conjecture holds up to an additive constant

In 2017, Aharoni proposed the following generalization of the Caccetta-H...
05/18/2022

Reconfiguration of Digraph Homomorphisms

For a fixed graph H, the H-Recoloring problem asks whether for two given...
05/11/2022

Components and Cycles of Random Mappings

Each connected component of a mapping {1,2,...,n}→{1,2,...,n} contains a...