THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS

DOI10.1073/pnas.52.3.688zbMath0126.39301OpenAlexW2018472489WikidataQ34412261 ScholiaQ34412261MaRDI QIDQ5331778

Thomas L. Saaty

Publication date: 1964

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.52.3.688

zbMATH Keywords

topology

Related Items

Arc diagrams, flip distances, and Hamiltonian triangulations, Unnamed Item, A survey of graphs with known or bounded crossing numbers, A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\), The topological Tverberg theorem and winding numbers