New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of K_n

Author： Aichholzer Oswin Garcia Jesus Orden David Ramos Pedro

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.38, Iss.1, 2007-07, pp. : 1-14

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

NEW REDUCTIONS AND LOGARITHMIC LOWER BOUNDS FOR THE NUMBER OF CONJUGACY CLASSES IN FINITE GROUPS

Bulletin of the Australian Mathematical Society, Vol. 87, Iss. 3, 2013-06 ,pp. : 406-424

Cambridge University Press

Access to resources Recommend Favorite

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

Odd Crossing Number and Crossing Number Are Not the Same

By Pelsmajer Michael Schaefer Marcus Štefankovič Daniel

Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. : 442-454

Springer Publishing Company

Access to resources Recommend Favorite

Some Bounds for the Number of Blocks

By Noda R.

European Journal of Combinatorics, Vol. 22, Iss. 1, 2001-01 ,pp. : 91-94

Elsevier

Access to resources Recommend Favorite

Some Bounds for the Number of Blocks II

By Noda R.

European Journal of Combinatorics, Vol. 22, Iss. 1, 2001-01 ,pp. : 95-100

Elsevier

Access to resources Recommend Favorite