Using block designs in crossing number bounds

DOI10.1002/jcd.21665zbMath1427.05060arXiv1807.03430OpenAlexW2963894154MaRDI QIDQ5204969

Libby Taylor, John Asplund, Gwen Spencer, Arran Hamm, Garner Cochran, Zhiyu Wang, Éva Czabarka, László A. Székely, Gregory J. Clark

Publication date: 10 December 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.03430

zbMATH Keywords

Kirkman triple systemresolvable group divisible designresolvable balanced incomplete block design\(k\)-planar crossing number

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Using block designs in crossing number bounds