Combinatorics · Mathematics
Graphs with bounded tree-width and large odd-girth are almost bipartite
Alexandr V. Kostochka, Daniel Kral', Jean-Sebastien Sereni, Michael Stiebitz
2009-04-16
Combinatorics · Mathematics
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon +1
2025-11-04
Discrete Mathematics · Computer Science
(Theta, triangle)-free and (even hole, $K_4$)-free graphs. Part 2 : bounds on treewidth
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
2023-10-23
Combinatorics · Mathematics
A tight Erd\H{o}s-P\'osa function for long cycles
Frank Mousset, Andreas Noever, Nemanja Škorić, Felix Weissenberger
2016-03-25
Combinatorics · Mathematics
Dirac's theorem for graphs of bounded bandwidth
Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, Olaf Parczyk +1
2026-02-17
Combinatorics · Mathematics
Cycle-maximal triangle-free graphs
Stephane Durocher, David S. Gunderson, Pak Ching Li, Matthew Skala
2014-10-30
Combinatorics · Mathematics
Spanning trees in graphs without large bipartite holes
Jie Han, Jie Hu, Lidan Ping, Guanghui Wang +2
2023-02-09
Data Structures and Algorithms · Computer Science
Efficient Enumeration of Chordless Cycles
Elisângela Silva Dias, Diane Castonguay, Humberto Longo, Walid Abdala Rfaei Jradi
2014-12-01
Combinatorics · Mathematics
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin, Ni Luh Dewi Sintiari +2
2022-03-23