On edges crossing few other edges in simple topological complete graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F06%3A00206166" target="_blank" >RIV/00216208:11320/06:00206166 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On edges crossing few other edges in simple topological complete graphs

Original language description

Let $h=h(n)$ be the smallest integer such that every simple topological complete graph on $n$ vertices contains an edge crossing at most $h$ other edges. We show that $Omega(n^{3/2})le h(n) le O(n^2/log^{1/4}n)$. We also show that the analogous function on other surfaces (torus, Klein bottle) grows as $cn^2$.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2006

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Graph Drawing

ISBN

3-540-31425-3

ISSN

—

e-ISSN

—

Number of pages

11

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

Berlin

Event date

Jan 1, 2006

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000235806300025