Paper Info
Title
On the Maximum Number of Independent Elements in Configurations of Points and Lines
Abstract
We show that the upper bound for the maximum number of independent elements of a $$(v_r)$$ ( v r ) configuration is given by $$\lfloor 2v/(r+1) \rfloor $$ 2 v / ( r + 1 ) and that this bound is attained for all integer values of $$r$$ r by geometric configurations of points and lines in the Euclidean plane. This disproves a conjecture of Branko Grünbaum.
Year
DOI
Venue
2014
10.1007/s00454-014-9618-1
Discrete & Computational Geometry
Keywords
Field
DocType
Configuration of points and lines,Unsplittable configuration,Unsplittable graph,Independent set,Levi graph,Grünbaum graph,51A20,05B30
Integer,Topology,Combinatorics,Upper and lower bounds,Independent set,Euclidean geometry,Levi graph,Conjecture,Mathematics
Journal
Volume
Issue
ISSN
52
2
0179-5376
Citations 
PageRank 
References 
0
0.34
1
Authors
2
Name
Order
Citations
PageRank
Tomaž Pisanski121444.31
Thomas W. Tucker2191130.07