scientific article; zbMATH DE number 4099322

From MaRDI portal
Publication:3824324





[For the entire collection see Zbl 0665.00002.] A k-campaign graph is a plane geometric configuration in which each (unextended) line lies on (precisely) k points, and every point is an endpoint of (precisely) one line. For example, 2-campaign graphs are unions of disjoint line segments. The author characterizes 3-campaign graphs and constructs 4-campaign graphs. He then remarks that in spite of the great increase in the number of k-campaign graphs as k increases from 3 to 4, no such graphs had been found for \(k>5\). In a postscript it is announced that Branko Grünbaum has constructed a new family of 5- campaign graphs and a single example of a 6-campaign graph (on 90 lines).











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 Q3824324)