File:Zarankiewicz-4-3.svg
Summary
| Description |
English: A bipartite graph with 4 vertices on each side, 13 edges, and no K3,3 subgraph, and an equivalent configuration of 13 points in a 4×4 grid for which no 3×3 subset of rows and columns is completely occupied. This example gives the answer to the Zarankiewicz problem in the case n = 4 and t = 3. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
