On the maximum number of edges of non-flowerable coin graphs

Details On the maximum number of edges of non-flowerable coin graphs On the maximum number of edges of non-flowerable coin graphs

2009-09-23

arxiv.org/abs/0909.4315v1

Mathematics

Combinatorics

7 pages, 2 figuers

Scientific paper

For $n\in\nats$ and $3\leq k\leq n$ we compute the exact value of $E_k(n)$, the maximum number of edges of a simple planar graph on $n$ vertices where each vertex bounds an $\ell$-gon where $\ell\geq k$. The lower bound of $E_k(n)$ is obtained by explicit construction, and the matching upper bound is obtained by using Integer Programming (IP.) We then use this result to conjecture the maximum number of edges of a non-flowerable coin graph on $n$ vertices. A {\em flower} is a coin graph representation of the wheel graph. A collection of coins or discs in the Euclidean plane is {\em non-flowerable} if no flower can be formed by coins from the collection.

Affiliated with

Also associated with

No associations

Rating

On the maximum number of edges of non-flowerable coin graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the maximum number of edges of non-flowerable coin graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the maximum number of edges of non-flowerable coin graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424531