Using block designs in crossing number bounds-Reference-Cited by-同舟云学术

Using block designs in crossing number bounds

Author:

Asplund John¹^ORCID,Clark Gregory²,Cochran Garner³,Czabarka Éva²⁴,Hamm Arran⁵,Spencer Gwen⁶,Székely László²⁴,Taylor Libby⁷,Wang Zhiyu²

Affiliation:

1. Department of Technology and MathematicsDalton State College Dalton Georgia

2. Department of MathematicsUniversity of South Carolina Columbia South Carolina

3. Department of Mathematics and Computer ScienceBerry College Mt Berry Georgia

4. Department of Pure and Applied MathematicsUniversity of Johannesburg Auckland Park, Johannesburg South Africa

5. Department of MathematicsWinthrop University Rock Hill South Carolina

6. Department of Mathematics and StatisticsSmith College Northampton Massachusetts

7. Department of MathematicsStanford University Stanford California

Funder

American Mathematical Society

National Science Foundation

Publisher

Wiley

Subject

Discrete Mathematics and Combinatorics

Link

Reference33 articles.

1. E.Ackerman On topological graphs with at most four crossings per edge arXiv:1509.01932.

2. P. Angelini et al. Beyond‐planarity: Density results for bipartite graphs arXiv:1712.09855.

3. k‐Planar crossing number of random graphs and random regular graphs;Asplund J.;Discrete Appl. Math.

4. Nearly Kirkman triple systems;Baker R. D.;Util. Math,1977

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献