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

DOI10.1007/S00453-017-0378-1MaRDI QIDQ1755751zbMATH OpenOpenAlexFDO

Authors Ildikó Schlotter, Katarina Cechlárová

Publication date 11 January 2019

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-017-0378-1

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A connection between sports and matroids: how many teams can we beat?
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• On maximal independent sets of vertices in claw-free graphs
• Parameterized complexity of induced graph matching on claw-free graphs

This page was built for publication: Correction to: ``A connection between sports and matroids: how many teams can we beat?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755751)