GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Main page
  • Community portal
  • Requested entries
  • Recent changes
  • Random entry
  • Help
  • Glossary
  • Contact us
  • Special pages
  • Search
  • Donations
  • Create account
  • Beginning
  • What links here

This view

  • Original page
  • New address

GeezerVison is showing en.wiktionary.org — Zarankiewicz problem - Wiktionary, the free dictionary

English

Etymology

Named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.

Proper noun

the Zarankiewicz problem

  1. (graph theory) An unsolved problem in mathematics, asking for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.

Related terms

  • Zarankiewicz function
Retrieved from "https://en.wiktionary.org/w/index.php?title=Zarankiewicz_problem&oldid=82060197"
Categories:
  • English lemmas
  • English proper nouns
  • English uncountable nouns
  • English multiword terms
  • en:Graph theory
  • English eponyms
Hidden categories:
  • Pages with entries
  • Pages with 1 entry
You are visitor 01402639 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.