OurBigBook About$ Donate
 Sign in Sign up

Regular pair of vertex sets

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Probabilistic combinatorics Edge density of a bipartite graph
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
A pair (A,B) is ε-regular when
∣d(X,Y)−d(A,B)∣≤ε
(1)
whenever X⊆A, Y⊆B, ∣X∣≥ε∣A∣, and ∣Y∣≥ε∣B∣.
  • Table of contents
    • Szemerédi regularity lemma Regular pair of vertex sets

Szemerédi regularity lemma

 1  0
Regular pair of vertex sets
For every ε>0 and m0​ there are M,n0​ such that every graph on at least n0​ vertices has a partition
V=V0​⊔V1​⊔⋯⊔Vm​,
(1)
where m0​≤m≤M, ∣V0​∣≤ε∣V∣, the other parts have equal size, and all but at most εm2 pairs (Vi​,Vj​) are ε-regular.

 Ancestors (7)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 122 / 3 / a / 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