Johannes Pardey

activity

20202023

most citedMaximizing the Mostar index for bipartite graphs and split graphs

2 citations · 3 across the 14 of their papers we have counts for

collaborators

Showing 2021Show all

6 papers · 1 filter

math.CO2021

Diameter, edge-connectivity, and $C_{4}$ -freeness

Vanessa Hiebeler, Johannes Pardey, Dieter Rautenbach

Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that $d \leq (2 n - 3) /5$ for every connected $C_{4}$ -free graph of order $n$ , diameter $d$ , and edge-connectivit…

math.CO2021

Factorially many maximum matchings close to the Erdős-Gallai bound

Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta +1

A classical result of Erdős and Gallai determines the maximum size $m (n, ν)$ of a graph $G$ of order $n$ and matching number $ν n$ . We show that $G$ has factorially many maximum matc…

math.CO2021

Unbalanced spanning subgraphs in edge labeled complete graphs

Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta +1

Let $K$ be a complete graph of order $n$ . For $d \in (0, 1)$ , let $c$ be a $\pm 1$ -edge labeling of $K$ such that there are $d (2 n)$ edges with label $+ 1$ , and let $G$ be a sp…

math.CO2021

Almost color-balanced perfect matchings in color-balanced complete graphs

Johannes Pardey, Dieter Rautenbach

For a graph $G$ and a not necessarily proper $k$ -edge coloring $c : E (G) \to {1, \dots, k}$ , let $m_{i} (G)$ be the number of edges of $G$ of color $i$ , and call $G$ {\it color-balance…

math.CO2021

Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation

Johannes Pardey, Dieter Rautenbach

For a fixed positive $ε$ , we show the existence of a constant $C_{ε}$ with the following property: Given a $\pm 1$ -edge-labeling $c : E (K_{n}) \to {- 1, 1}$ of the complete graph $K_{n}$ wi…

math.CO2021

Zero-sum copies of spanning forests in zero-sum complete graphs

Elena Mohr, Johannes Pardey, Dieter Rautenbach

For a complete graph $K_{n}$ of order $n$ , an edge-labeling $c : E (K_{n}) \to {- 1, 1}$ satisfying $c (E (K_{n})) = 0$ , and a spanning forest $F$ of $K_{n}$ , we consider the problem to minimize…

Diameter, edge-connectivity, and C4​-freeness

Factorially many maximum matchings close to the Erdős-Gallai bound

Unbalanced spanning subgraphs in edge labeled complete graphs

Almost color-balanced perfect matchings in color-balanced complete graphs

Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation

Zero-sum copies of spanning forests in zero-sum complete graphs

Diameter, edge-connectivity, and $C_{4}$ -freeness