OurBigBook About$ Donate
 Sign in Sign up

Spectral discrepancy bound for a biregular graph (∣e(A,B)−δ∣A∣∣B∣∣≤s∣A∣∣B∣​)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Bipartite graph Biregular graph Quasirandom bipartite graph
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Let H=M−δJ be the centered biadjacency matrix of an equal-part biregular graph, and put s=∥H∥op​. For subsets A,B of the two parts, their edge discrepancy is 1AT​H1B​. The Cauchy-Schwarz inequality proves the displayed bound. If the part size is n, centering the two indicator vectors improves it to snα(1−α)β(1−β)​. The centered four-cycle identity for a biregular graph shows that t4​(G)≤δ4(1+c4) implies s≤cδn for c≥0.

 Ancestors (8)

  1. Quasirandom bipartite graph
  2. Biregular graph
  3. Bipartite graph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • 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