A Combinatorial Problem in Matching

DOI10.1112/jlms/s1-44.1.60zbMath0182.02803OpenAlexW1964776956MaRDI QIDQ5573409

J. G. Kalbfleisch, Ralph G.Stanton

Publication date: 1969

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-44.1.60

zbMATH Keywords

combinatorics

Related Items (18)

Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ On \((p,1)\)-subnormal \(q\)-ary covering codes ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Short coverings in tridimensional spaces arising from sum-free sets ⋮ How to guess two letters correctly ⋮ Short covering codes arising from matchings in weighted graphs ⋮ On mixed codes with covering radius 1 and minimum distance 2 ⋮ Sharp covering of a module by cyclic submodules ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ \((r,k)\)-catching code ⋮ On covering sets and error-correcting codes ⋮ Short coverings and matching in weighted graphs ⋮ Bounds for covering codes over large alphabets ⋮ On codes with covering radius 1 and minimum distance 2 ⋮ Hypercube Packings and Coverings with Higher Dimensional Rooks

This page was built for publication: A Combinatorial Problem in Matching