Finitely forcible graphons

Details Finitely forcible graphons Finitely forcible graphons

2009-01-07

arxiv.org/abs/0901.0929v1

Mathematics

Combinatorics

30 pages

Scientific paper

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turan, Erdos-Simonovits and Chung-Graham-Wilson, we construct numerous finitely forcible graphons. Most of these fall into two categories: one type has an algebraic structure and the other type has an iterated (fractal-like) structure. We also give some necessary conditions for forcibility, which imply that finitely forcible graphons are "rare", and exhibit simple and explicit non-forcible graphons.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61893