AI Chat AI Image Generator AI Video Text to Speech

Strong Hanani-Tutte for the Torus

09/01/2020

∙

by Radoslav Fulek, et al.

∙

∙

If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.

Radoslav Fulek
10 publications
Michael J. Pelsmajer
1 publication
Marcus Schaefer
6 publications

page 1

page 2

page 3

page 4

research

∙ 09/20/2022

A tight bound for the number of edges of matchstick graphs

A matchstick graph is a plane graph with edges drawn as unit-distance li...

0 Jérémy Lavollée, et al. ∙

research

∙ 07/24/2020

Improving the dilation of a metric graph by adding edges

Most of the literature on spanners focuses on building the graph from sc...

0 Joachim Gudmundsson, et al. ∙

research

∙ 09/14/2017

Embedded-Graph Theory

In this paper, we propose a new type of graph, denoted as "embedded-grap...

0 Atsushi Yokoyama, et al. ∙

research

∙ 08/30/2018

The number of crossings in multigraphs with no empty lens

Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...

0 Michael Kaufmann, et al. ∙

research

∙ 08/25/2020

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...

0 Stefan Felsner, et al. ∙

research

∙ 11/20/2017

Edge Estimation with Independent Set Oracles

We study the problem of estimating the number of edges in a graph with a...

0 Paul Beame, et al. ∙

research

∙ 11/23/2017

Identification of Strong Edges in AMP Chain Graphs

The essential graph is a distinguished member of a Markov equivalence cl...

0 Jose M. Peña, et al. ∙