Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Meike Hatzel

Meike Hatzel

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Combinatorics×2Discrete Math×2

Frequent co-authors

Sebastian Wiederrecht2×
Ken-ichi Kawarabayashi1×
Stephan Kreutzer1×
J. Pascal Gollin1×
Maximilian Gorsky1×
Kevin Hendrey1×

Research Timeline

2026
An Erdős-Pósa theorem for cycles and faces of distinct lengths

This paper shows that for every graph, there exist a certain number of vertex-disjoint cycles of different lengths, or a smaller set of vertices such that the graph without these vertices has fewer cycle lengths. Similar results are proven for facial lengths of embedded graphs. The paper also shows that subdivided ladders have only a small number of cycle lengths.

A directed flat wall theorem excluding a crossrow grid

The paper presents an alternative version of the directed flat wall theorem, improving upon existing ones by excluding a different digraph as a butterfly minor.

Highlighted terms show continued research focus across papers

Papers

math.COcs.DMTheoreticalRecentAug 4, 2026

A directed flat wall theorem excluding a crossrow grid

Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht

The paper presents an alternative version of the directed flat wall theorem, improving upon existing ones by excluding a different digraph as a butterfly minor.

View →
math.COcs.DMTheoretical
Recent
Jul 8, 2026

An Erdős-Pósa theorem for cycles and faces of distinct lengths

J. Pascal Gollin, Maximilian Gorsky, Meike Hatzel, Kevin Hendrey +5 more

This paper shows that for every graph, there exist a certain number of vertex-disjoint cycles of different lengths, or a smaller set of vertices such that the graph without these vertices has fewer cy…

View →