A connection between sports and matroids: how many teams can we beat?

DOI10.1007/s00453-016-0256-2zbMath1406.05015MaRDI QIDQ1702129

Katarína Cechlárova, Ildikó Schlotter

Publication date: 28 February 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/61819/1/mbc.pdf

zbMATH Keywords

approximation; matroids; graph labelling; parameterized complexity; sports elimination problem; gammoids

Mathematics Subject Classification ID

52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)

05B35: Combinatorial aspects of matroids and geometric lattices

05C78: Graph labelling (graceful graphs, bandwidth, etc.)