Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...

Text: : "Graph Theory" by J. Adrian Bondy and U.S.R. Murty; Graduate Texts in Mathematics 244, Springer 2008. ISBN 978-1-84628-969-9, 2nd printing, 978-1-84628-970-5 (ebook). Notes will be supplied ...

It has been an exhilarating year in combinatorics research. In early 2023, mathematicians were stunned when two of the biggest problems in the field were solved in as many months. Now, a third major ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...