Factors of Regular Graphs

The main research objective of the present project has been the study of the existence of pairwise disjoint perfect matchings in regular graphs. We prove the existence of highly edge-connected regular graphs which have only „few'' pairwise disjoint perfect matchings.

Duration: 01/2022 - 12/2022

Funded by: Heinrich Hertz-Stiftung

Flows and matchings in graphs

Graph coloring theory is a cornerstone of discrete mathematics, occupying a central position. Research on the 4-Color Conjecture (established as the 4-Color Theorem since 1976) has significantly influenced graph theory. Tait (1880) demonstrated that the 4-Color Theorem is equivalent to the statement that every planar bridgeless cubic graph is ...

Duration: 01/2021 - 12/2023

Funded by: DAAD

Factors in Graphs

Edge coloring and factors of graphs are classical areas of graph theory. Early and fundamental theorems of graph theory, such as König's theorem (1916) or Petersen's theorem (1891) make statements about edge colorings and factors of graphs. Factors of regular graphs are of particular interest. Vizing (1965) showed that the minimum number of colors, ...

Duration: 01/2020 - 12/2024

Funded by: DFG

The Research Programme "Digital Future"

With our research program we aim at the development of the scientific basis for a master plan “Digital future” for employers, employees, freelancers and private persons to support them in the proactive forming of the digital transition. Our research is based on a holistic concept. Following this approach we identify where the digital transition ...

Duration: 01/2017 - 04/2021

Funded by: MKW NRW

PACE: Paderborn Center for Advanced Studies

Duration: 01/2016 - 12/2023

Funded by: MKW NRW

Contact: Astrid Canisius, Prof. Dr. Eckhard Steffen

NRW Research College Work 4.0: Design of flexible working environments - People-centered use of cyber-physical systems in Industry 4.0

For production companies, the transition to Industry 4.0 opens up great opportunities for modernization and the associated increase in the efficiency of production processes. In addition to the still largely existing technical challenges involved in developing such systems, the role of employees throughout the entire value chain is undergoing ...

Duration: 08/2014 - 12/2022

Funded by: MKW NRW

Contact: Prof. Dr. Gregor Engels, Prof. Dr. Martin Schneider, Prof. Dr. Eckhard Steffen, Prof. Dr.-Ing. Roman Dumitrescu, Prof. Dr. Christian Harteis, Prof. Dr. Iris Gräßler, Prof. Dr. Eric Bodden, Anja-Kristin Abendroth, Martin Diewald, Stefan Kopp, Günter W. Maier, Frank Ulrich Rückert, Britta Wrede

Covers and cores of r-graphs

There are many hard problems in graph theory which can be solved in the general case if they can be solved for cubic graphs. Examples of such problems are the 4-color-problem (now a theorem), problems concerning cycle- and matching-covers, surface embeddings or flow-problems on graphs. The majority of these problems is easy to solve for ...

Duration: 01/2013 - 12/2017

Funded by: DFG