Listing 6-cycles in sparse graphs

DOI10.4230/LIPICS.ITCS.2025.92MaRDI QIDQ7296740zbMATH OpenFDO

Authors Virginia Vassilevska Williams, Alek Westover

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2025.92

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs.
• Color-coding
• Cycles of even length in graphs
• Finding and counting given length cycles
• Finding Even Cycles Even Faster
• Graph Theory and Additive Combinatorics
• Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond
• Listing 6-cycles
• Removing additive structure in 3SUM-based reductions
• Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
• Subcubic equivalences between path, matrix, and triangle problems
• Supersaturation of even linear cycles in linear hypergraphs

This page was built for publication: Listing 6-cycles in sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296740)