Publication

Space crossing numbers

2011
Report or working paper

Abstract

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs.

Official source

https://infoscience.epfl.ch/record/175650?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Space crossing numbers

Graph Chatbot

Chat with Graph Search

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

In Medio Stat Virtus: Combining Boolean and Pattern Matching

A full characterization of invariant embeddability of unimodular planar graphs

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

A full characterization of invariant embeddability of unimodular planar graphs

In Medio Stat Virtus: Combining Boolean and Pattern Matching