Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Zarankiewicz_problem> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Zarankiewicz_problem 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.".
- Zarankiewicz_problem thumbnail Zarankiewicz-4-3.svg?width=300.
- Zarankiewicz_problem wikiPageID "3480707".
- Zarankiewicz_problem wikiPageRevisionID "604433000".
- Zarankiewicz_problem hasPhotoCollection Zarankiewicz_problem.
- Zarankiewicz_problem subject Category:Extremal_graph_theory.
- Zarankiewicz_problem subject Category:Mathematical_problems.
- Zarankiewicz_problem subject Category:Unsolved_problems_in_mathematics.
- Zarankiewicz_problem type Abstraction100002137.
- Zarankiewicz_problem type Attribute100024264.
- Zarankiewicz_problem type Condition113920835.
- Zarankiewicz_problem type Difficulty114408086.
- Zarankiewicz_problem type MathematicalProblems.
- Zarankiewicz_problem type Problem114410605.
- Zarankiewicz_problem type State100024720.
- Zarankiewicz_problem 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.".
- Zarankiewicz_problem label "Zarankiewicz problem".
- Zarankiewicz_problem sameAs m.09fs3_.
- Zarankiewicz_problem sameAs Q8066611.
- Zarankiewicz_problem sameAs Q8066611.
- Zarankiewicz_problem sameAs Zarankiewicz_problem.
- Zarankiewicz_problem wasDerivedFrom Zarankiewicz_problem?oldid=604433000.
- Zarankiewicz_problem depiction Zarankiewicz-4-3.svg.
- Zarankiewicz_problem isPrimaryTopicOf Zarankiewicz_problem.
