Agnes Totschnig

activity

20222026

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.GT2025

The Popular Dimension of Matchings

Frank Connor, Louis-Roy Langevin, Ndiamé Ndiaye +3

We study popular matchings in three classical settings: the house allocation problem, the marriage problem, and the roommates problem. In the popular matching problem, (a subset of…

math.CO2025

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable

Sergey Norin, Agnes Totschnig

Let $K_{7}^{\lor}$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that ever…

The Popular Dimension of Matchings

Every graph with no K7∨​-minor is 6-colorable

Every graph with no $K_{7}^{\lor}$ -minor is $6$ -colorable