Crossing numbers of random graphs (Q4798172)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 1884732

Language	Label	Description	Also known as
English	Crossing numbers of random graphs	scientific article; zbMATH DE number 1884732

Statements

scholarly article

0 references

Crossing numbers of random graphs (English)

0 references

0 references

0 references

Random Structures & Algorithms

0 references

publication date

19 March 2003

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/rsa.10053

0 references

The number of polytopes, configurations and real matroids

0 references

Nearly perfect matchings in regular simple hypergraphs

0 references

Weighted sums of certain dependent random variables

0 references

Bounds for rectilinear crossing numbers

0 references

Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics

0 references

Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)

0 references

0 references

Concentration of multivariate polynomials and its applications

0 references

New lower bound techniques for VLSI

0 references

A Separator Theorem for Planar Graphs

0 references

Bisecting sparse random graphs

0 references

Applications of the crossing number

0 references

0 references

Which crossing number is it anyway?

0 references

Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs

0 references

Counting extensions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1002/rsa.10053

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4798172

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4798172&oldid=34335646"