Augmentation of covering arrays of strength two

DOI10.1007/s00373-014-1519-9zbMath1327.05040OpenAlexW1965687751MaRDI QIDQ897271

Charles J. Colbourn

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1519-9

zbMATH Keywords

augmentationKruskal-Katona theoremcovering array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Covering and radius-covering arrays: constructions and classification
• Edge disjoint placement of graphs
• A new short proof for the Kruskal-Katona theorem
• Randomized post-optimization of covering arrays
• A simple proof of the Kruskal-Katona theorem
• Problems and algorithms for covering arrays
• Strength two covering arrays: existence tables and projection
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On the state of strength-three covering arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Augmentation of covering arrays of strength two