Project Details
Projekt Print View

Erdös-Pósa properties

Subject Area Mathematics
Term from 2016 to 2021
Project identifier Deutsche Forschungsgemeinschaft (DFG) - Project number 321904558
 
Final Report Year 2021

Final Report Abstract

In graph theory, we often look for many disjoint instances of some target graphs in a host graph. For instance, we might look for many disjoint cycles in a given graph; this is then called a packing of cycles. Not every graph will contain a large packing: for example, a graph that admits a small covering, a vertex set that meets all target graphs, will not contain a large packing. For some target graphs (eg, cycles) there will always be a dichotomy between packing and covering: every host graph has either a large packing or a small covering. For other target graphs (eg, odd cycles) there are host graphs that have neither: no large packing and no small covering. In this project, we have investigated the interplay between packing and cov- ering. A particular focus was on the edge-variant of this interplay, where instead of (vertex-)disjoint target graphs we seek merely edge-disjoint target graphs, and where instead of a covering consisting of vertices we only admit coverings of edges. That packing and covering in the normal and in the edge-variant behave very differently is the main insight of this project. (There were signs pointing to similar behaviour.)

Publications

 
 

Additional Information

Textvergrößerung und Kontrastanpassung