This is a file from the Wikimedia Commons

File:Zarankiewicz K4 7.svg Information

From Wikipedia
https://en.wikipedia.org/wiki/File:Zarankiewicz_K4_7.svg

Original file(SVG file, nominally 512 × 512 pixels, file size: 2 KB)

Summary

Description A crossing-minimal drawing of the complete bipartite graph K4,7 with 18 crossings (red dots), solving Turán's brick factory problem for parameters (4,7), by CMG Lee.
Source Own work
Author Cmglee

Licensing

I, the copyright holder of this work, hereby publish it under the following licenses:
w:en:Creative Commons

attribution share alike

This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
You may select the license of your choice.

Information

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current 02:01, 4 December 2020 Thumbnail for version as of 02:01, 4 December 2020512 × 512 (2 KB)CmgleePut red spots behind lines to show that they are not intended as vertices.
21:39, 9 November 2020 Thumbnail for version as of 21:39, 9 November 2020512 × 512 (2 KB)Cmglee{{Information |Description=A crossing-minimal drawing of the complete bipartite graph K4,7 with 18 crossings (red dots), solving Turán's brick factory problem for parameters (4,7), by CMG Lee. |Source={{own}} |Date= |Author= Cmglee |Permission= |other_versions= }} Category:Bipartite graphs
The following pages on the English Wikipedia use this file (pages on other projects are not listed):

Global file usage

The following other wikis use this file:

Metadata