On the maximum number of non-intersecting diagonals in an array

MaRDI QIDQ2953144zbMATH OpenFDO

Authors Peter Boyland, Gabriella A. Pintér, Ivan Roth, Jon E. Schoenfield, Stephen Wasielewski, István G. Laukó

Publication date 3 January 2017

Full work available at URL http://www.emis.de/journals/JIS/VOL20/Pinter/pinter3.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

constrained optimizationdiagonal placementmaximum independent set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Mathematical programming (90C99)

Recommendations

• A note on arrays of dots with distinct slopes
• Putting dots in triangles
• Progress in the no-three-in-line-problem
• The extensible no-three-in-line problem
• Connecting the dots: maximal polygons on a square grid

Cited in

(2)

• Connecting the dots: maximal polygons on a square grid
• scientific article; zbMATH DE number 7539874 (Why is no real title available?)

Describes a project that uses

Uses Software

• CPLEX
• OEIS

This page was built for publication: On the maximum number of non-intersecting diagonals in an array

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