×

Correction to: “A connection between sports and matroids: how many teams can we beat?”. (English) Zbl 1412.05034

Correction to the authors’ paper [ibid. 80, No. 1, 258–278 (2018; Zbl 1406.05015)].

MSC:

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

Citations:

Zbl 1406.05015
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Hermelin, D., van Leeuwen, E.J.: Parameterized complexity of induced graph matching on claw-free graphs. Algorithmica 70(3), 513-530 (2014) · Zbl 1306.05163
[2] Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28(3), 284-304 (1980) · Zbl 0434.05043 · doi:10.1016/0095-8956(80)90074-X
[3] Sbihi, N.: Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29(1), 53-76 (1980) · Zbl 0444.05049 · doi:10.1016/0012-365X(90)90287-R
[4] Schlotter, I., Cechlárová, K.: A connection between sports and matroids: How many teams can we beat? Algorithmica (to appear). doi:10.1007/s00453-016-0256-2 · Zbl 1406.05015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.