Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q8066611> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Q8066611 subject Q7132786.
- Q8066611 subject Q7132787.
- Q8066611 subject Q8432514.
- Q8066611 abstract "The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given number of vertices but has no complete bipartite subgraphs of a given size. It belongs to the field of extremal graph theory, a branch of combinatorics, and is named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.The Kővári–Sós–Turán theorem, named after Tamás Kővári, Vera T. Sós, and Pál Turán, provides an upper bound on the solution to the Zarankiewicz problem. When the forbidden complete bipartite subgraph has one side with at most three vertices, this bound has been proven to be within a constant factor of the correct answer. For larger forbidden subgraphs, it remains the best known bound, and has been conjectured to be tight. Applications of the Kővári–Sós–Turán theorem include bounding the number of incidences between different types of geometric object in discrete geometry.".
- Q8066611 thumbnail Zarankiewicz-4-3.svg?width=300.
- Q8066611 wikiPageWikiLink Q1047749.
- Q8066611 wikiPageWikiLink Q1077896.
- Q8066611 wikiPageWikiLink Q1242232.
- Q8066611 wikiPageWikiLink Q1252145.
- Q8066611 wikiPageWikiLink Q1304193.
- Q8066611 wikiPageWikiLink Q13222616.
- Q8066611 wikiPageWikiLink Q1395814.
- Q8066611 wikiPageWikiLink Q141488.
- Q8066611 wikiPageWikiLink Q1475760.
- Q8066611 wikiPageWikiLink Q174733.
- Q8066611 wikiPageWikiLink Q1789829.
- Q8066611 wikiPageWikiLink Q19063.
- Q8066611 wikiPageWikiLink Q1994977.
- Q8066611 wikiPageWikiLink Q222032.
- Q8066611 wikiPageWikiLink Q269878.
- Q8066611 wikiPageWikiLink Q2916484.
- Q8066611 wikiPageWikiLink Q297206.
- Q8066611 wikiPageWikiLink Q3046737.
- Q8066611 wikiPageWikiLink Q338374.
- Q8066611 wikiPageWikiLink Q383444.
- Q8066611 wikiPageWikiLink Q44337.
- Q8066611 wikiPageWikiLink Q460044.
- Q8066611 wikiPageWikiLink Q4915409.
- Q8066611 wikiPageWikiLink Q5467387.
- Q8066611 wikiPageWikiLink Q5467390.
- Q8066611 wikiPageWikiLink Q6535569.
- Q8066611 wikiPageWikiLink Q7132786.
- Q8066611 wikiPageWikiLink Q7132787.
- Q8066611 wikiPageWikiLink Q721695.
- Q8066611 wikiPageWikiLink Q739245.
- Q8066611 wikiPageWikiLink Q752718.
- Q8066611 wikiPageWikiLink Q76592.
- Q8066611 wikiPageWikiLink Q812880.
- Q8066611 wikiPageWikiLink Q83043.
- Q8066611 wikiPageWikiLink Q841007.
- Q8066611 wikiPageWikiLink Q8432514.
- Q8066611 wikiPageWikiLink Q906377.
- Q8066611 wikiPageWikiLink Q913598.
- Q8066611 wikiPageWikiLink Q959831.
- Q8066611 comment "The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given number of vertices but has no complete bipartite subgraphs of a given size. It belongs to the field of extremal graph theory, a branch of combinatorics, and is named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.The Kővári–Sós–Turán theorem, named after Tamás Kővári, Vera T.".
- Q8066611 label "Zarankiewicz problem".
- Q8066611 depiction Zarankiewicz-4-3.svg.