Subgraph densities in signed graphons and the local Sidorenko conjecture

Details Subgraph densities in signed graphons and the local Sidorenko conjecture Subgraph densities in signed graphons and the local Sidorenko conjecture

2010-04-18

arxiv.org/abs/1004.3026v1

Mathematics

Combinatorics

20 pages

Scientific paper

We prove inequalities between the densities of various bipartite subgraphs in signed graphs and graphons. One of the main inequalities is that the density of any bipartite graph with girth r cannot exceed the density of the r-cycle. This study is motivated by Sidorenko's conjecture, which states that the density of a bipartite graph F with m edges in any graph G is at least the m-th power of the edge density of G. Another way of stating this is that the graph G with given edge density minimizing the number of copies of F is, asymptotically, a random graph. We prove that this is true locally, i.e., for graphs G that are "close" to a random graph.

Affiliated with

Also associated with

No associations

Rating

Subgraph densities in signed graphons and the local Sidorenko conjecture 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 Subgraph densities in signed graphons and the local Sidorenko conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subgraph densities in signed graphons and the local Sidorenko conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376740