Publication

Space crossing numbers

2011
Reports

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

Graph Chat

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

Chat with Graph Search

Lower bounds for Ramsey numbers of bounded degree hypergraphs

Towards quasi real-time simulations of district heating networks for an optimal sustainable design and control

Occlusion Resilient 3D Human Pose Estimation