OurBigBook About$ Donate
 Sign in Sign up

Bipartite four-cycle density (t4​(G)=Ex,x′,y,y′​G(x,y)G(x,y′)G(x′,y)G(x′,y′))

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Probabilistic combinatorics Edge density of a bipartite graph Bipartite four-cycle count
2026-10-06  0 By others on same topic  0 Discussions Create my own version
This is the part-preserving homomorphism density of a four-cycle in a bipartite graph with independently uniform labels x,x′ in the first part and y,y′ in the second. Repeated labels are included. It equals the fourth power of the four-cycle norm of the adjacency indicator function. It differs at finite sizes from a count requiring four distinct vertices.

 Ancestors (8)

  1. Bipartite four-cycle count
  2. Edge density of a bipartite graph
  3. Probabilistic combinatorics
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Centered four-cycle identity for a biregular graph
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 12 / 6 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook