Generating p-extremal graphs

Details Generating p-extremal graphs Generating p-extremal graphs

2011-05-09

arxiv.org/abs/1105.1764v1

Mathematics

Combinatorics

25 pages, 2 figures, 3 tables

Scientific paper

Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p perfect matchings and (n^2)/4+c_p edges. Based on Lovasz's Two Ear Theorem and structural results of Hartke, Stolee, West, and Yancey, we develop a computational method for determining c_p and generating the finite set of graphs which describe the infinite family of p-extremal graphs. This method extends the knowledge of the size and structure of p-extremal graphs from p <= 10 to p <= 27. These values provide further evidence towards a conjectured upper bound and prove the sequence c_p is not monotonic.

Affiliated with

Also associated with

No associations

Rating

Generating p-extremal 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 Generating p-extremal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating p-extremal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334691