On a problem of P. Erdös

DOI10.1016/S0021-9800(68)80013-4MaRDI QIDQ5572942zbMATH OpenFDO

Authors Paul C. Kainen

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(68)80013-4

zbMATH Keywords

complete graphcrossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cited in

(16)

• On a problem of P. Erdős
• scientific article; zbMATH DE number 3893887 (Why is no real title available?)
• Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
• scientific article; zbMATH DE number 5272072 (Why is no real title available?)
• scientific article; zbMATH DE number 3914676 (Why is no real title available?)
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen
• An upper bound for the rectilinear crossing number of the complete graph
• A distance problem of P. Erdős with some further restrictions
• Graph theory
• A note on fundamental, non-fundamental, and robust cycle bases
• Geometria combinatoria e geometrie finite
• scientific article; zbMATH DE number 988692 (Why is no real title available?)
• scientific article; zbMATH DE number 3838109 (Why is no real title available?)
• Coloring drawings of bipartite graphs: A problem in automated assembly
• scientific article; zbMATH DE number 4062037 (Why is no real title available?)
• On polynomials and crossing numbers of complete graphs

This page was built for publication: On a problem of P. Erdös

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572942)