On graphs with modularity zero or near-zero

DOI10.37236/12644MaRDI QIDQ7349263zbMATH OpenFDO

Authors Colin McDiarmid, Fiona Skerman

Publication date 16 September 2026

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

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph theory (including graph drawing) in computer science (68R10)

Cites work

This page was built for publication: On graphs with modularity zero or near-zero

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