scientific article; zbMATH DE number 1047749

MaRDI QIDQ4347916zbMATH OpenFDO

Authors Herbert S. Wilf

Publication date 11 August 1997

zbMATH Keywords

complete graphsgeometric probabilityrectilinear crossing number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Recommendations

• The rectilinear crossing number of K_n: closing in (or are we?)
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
• scientific article; zbMATH DE number 1452728
• On the crossing number of complete graphs

Cited in

(14)

• Restricted k-ary words and functional equations
• Some provably hard crossing number problems
• On the decay of crossing numbers
• The rectilinear crossing number of K_n: closing in (or are we?)
• ON THE SATELLITE CROSSING NUMBER CONJECTURE
• The Crossing Number of C_m × C_n: A Reluctant Induction
• Packing of (0, 1)-matrices
• scientific article; zbMATH DE number 1054768 (Why is no real title available?)
• scientific article; zbMATH DE number 2061148 (Why is no real title available?)
• scientific article; zbMATH DE number 1452728 (Why is no real title available?)
• On the Maximum Crossing Number
• Crossing Number Problems
• Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
• On the crossing number of complete graphs

This page was built for publication:

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