(Q266775)

English

crossing number

the smallest number of edge crossings possible in a drawing of a node-link graph

In more languages

Statements

0 references

non-negative integer

0 references

0 references

defining formula

{\textrm {cr}}(K_{m,n})\leq \left\lfloor {\frac {n}{2}}\right\rfloor \left\lfloor {\frac {n-1}{2}}\right\rfloor \left\lfloor {\frac {m}{2}}\right\rfloor \left\lfloor {\frac {m-1}{2}}\right\rfloor

1 reference

imported from Wikimedia project

English Wikipedia

maintained by WikiProject

WikiProject Mathematics

0 references

descriptive page and disambiguation page have to be in different items

0 references

Crossing number

descriptive page and disambiguation page have to be in different items

0 references

Identifiers

1 reference

Freebase Data Dumps

publication date

28 October 2013

Microsoft Academic ID

0 references

Sitelinks

Wikipedia(8 entries)

enwiki Crossing number (graph theory)
eswiki Número de cruce (teoría de grafos)
frwiki Nombre de croisements (théorie des graphes)
huwiki Metszési szám (gráfelmélet)
ruwiki Минимальное число пересечений рёбер графа
skwiki Priesečníkové číslo (teória grafov)
ukwiki Число схрещень
zhwiki 交叉數

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q266775&oldid=2023330525"