Towards a short proof of the Fulek–Kynčl criterion for modulo 2 embeddability of graphs to surfaces

12/22/2020 ∙ by Arthur Bikeev, et al. ∙ Mail.Ru Group 0

A connected graph K has a modulo 2 embedding to the sphere with g handles if and only if there is a general position PL map f of K in the plane and a symmetric square matrix A of size |E(K)| with modulo 2 entries and zeros on the diagonal such that rk A ≤ 2g and A_σ, τ = |fσ∩ fτ| mod 2 for any non-adjacent edges σ, τ. This is essentially proved by R. Fulek and J. Kynčl. The main of results of this note is an alternative proof of the (=>) part.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References