crossing number (Q2696)

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

Language	Label	Description	Also known as
English	crossing number	the smallest number of edge crossings possible in a drawing of a node-link graph

Statements

0 references

/m/04cx07j

1 reference

28 October 2013

{\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

0 references

42574938

0 references

0 references

0 references

0 references

Q266775

0 references