OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Ruzsa–Szemerédi problem

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Matching (graph theory)
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Ruzsa–Szemerédi problem is a question in the field of combinatorial number theory, particularly concerning sets of integers and their structure. It was posed by Hungarian mathematicians Imre Ruzsa and Endre Szemerédi. The problem revolves around the concept of progressions in subsets of integers. Specifically, it asks how large a subset of integers can be if it avoids certain arithmetic progressions of a given length.

 Ancestors (6)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 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