Counting the regions in a regular drawing of K_n,n

MaRDI QIDQ4933508zbMATH OpenFDO

Authors Martin Griffiths

Publication date 13 October 2010

Full work available at URL http://www.emis.de/journals/JIS/VOL13/Griffiths2/griffiths.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complete bipartite graphcrossinggreatest common divisorregion

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• The number of crossings in a regular drawing of the complete bipartite graph
• A parity theorem for drawings of complete and complete
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Geometric drawings of \(K_{n}\) with few crossings
• scientific article; zbMATH DE number 4198021

Cited in

(4)

• Regular dissections of an infinite strip
• Graphical enumeration and stained glass windows. I: Rectangular grids
• An upper bound for the average number of regions
• The number of crossings in a regular drawing of the complete bipartite graph

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting the regions in a regular drawing of \(K_{n,n}\)

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