AI Chat AI Image Generator AI Video Text to Speech

A linear bound for the Colin de Verdière parameter μ for graphs embedded on surfaces

03/01/2023

∙

by Camille Lanuel, et al.

∙

∙

We provide a combinatorial and self-contained proof that for all graphs G embedded on a surface S, the Colin de Verdière parameter μ(G) is upper bounded by 7-2χ(S).

Camille Lanuel
1 publication
Francis Lazarus
4 publications
Rudi Pendavingh
2 publications

page 1

page 2

page 3

page 4

research

∙ 04/15/2019

A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus

The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inhe...

0 Martin Grohe, et al. ∙

research

∙ 10/17/2022

A Category of Surface-Embedded Graphs

We introduce a categorical formalism for rewriting surface-embedded grap...

0 Malin Altenmüller, et al. ∙

research

∙ 02/06/2013

Learning Belief Networks in Domains with Recursively Embedded Pseudo Independent Submodels

A pseudo independent (PI) model is a probabilistic domain model (PDM) wh...

0 Jun Hu, et al. ∙

research

∙ 03/09/2023

Embedded graph 3-coloring and flows

A graph drawn in a surface is a near-quadrangulation if the sum of the l...

0 Caroline Bang, et al. ∙

research

∙ 05/04/2023

Homomorphisms between graphs embedded on surfaces

We extend the notion of graph homomorphism to cellularly embedded graphs...

0 Delia Garijo, et al. ∙

research

∙ 07/11/2023

Twin-width of graphs on surfaces

Twin-width is a width parameter introduced by Bonnet, Kim, Thomassé and ...

0 Daniel Kral, et al. ∙

research

∙ 05/17/2018

Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem

For the Asymmetric Traveling Salesman Problem (ATSP), it is known that t...

0 Mark Velednitsky, et al. ∙