activity
20222026
most citedTournament schedules and incentives in a double round-robin tournament with four teams

27 citations · 27 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2026

Nowhere-zero 4-flows in graphs excluding a proper minor of the Petersen graph

József Pintér

Tutte's -flow conjecture asserts that every finite bridgeless graph with no Petersen minor admits a nowhere-zero -flow. Let be the Petersen graph and let . We…

math.CO2026

The crumby coloring conjecture for subcubic outerplanar graphs

József Pintér

The red-blue vertex partitions now known as crumby colorings originate in a conjecture of Thomassen related to Wegner's conjecture on squares of planar graphs. In such a coloring,…

math.CO2026

Conformability is NP-complete, even on connected regular graphs

József Pintér

A graph is conformable if it admits a proper -coloring in which, among the color classes including the empty ones, at most ha…

math.CO2026

Subcubic -minor-free graphs without crumby colorings

József Pintér

Motivated by Wegner's conjecture on squares of planar graphs, Thomassen conjectured that every 3-connected cubic graph on at least eight vertices admits a red-blue vertex coloring…

cs.DS2026

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches

József Pintér, Regina Stangl

Network caching asks how to place contents in distributed caches so that future requests are served close to their users. Ganian, Mc Inerney and Tsigkari recently initiated the par…

math.CO2025

Color-avoiding connected colorings and orientations

József Pintér, Kitti Varga

We study network robustness under correlated failures modeled by colors, where each color represents a class of edges or vertices that may fail simultaneously. An edge-colored grap…

math.CO2023

Color-avoiding connected spanning subgraphs with minimum number of edges

József Pintér, Kitti Varga

We call a (not necessarily properly) edge-colored graph edge-color-avoiding connected if after the removal of edges of any single color, the graph remains connected. For vertex-col…

math.OC2022★ 27 cited

Tournament schedules and incentives in a double round-robin tournament with four teams

László Csató, Roland Molontay, József Pintér

In a round-robin tournament, a team may lack the incentive to win if its final rank does not depend on the outcome of the matches still to be played. This paper introduces a classi…