On the number of edges of separated multigraphs
type: Item
instance of: scholarly article
title: On the number of edges of separated multigraphs
DOI: 10.1007/978-3-030-92931-2_16
author: Jacob Fox
author: János Pach
author: Andrew Suk
publication date: 2022-07-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/2108.11290
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7551745
zbMATH Keywords: multigraphs
zbMATH Keywords: lenses
zbMATH Keywords: crossing lemma
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4205497438
cites work: Crossing-Free Subgraphs
cites work: On the Erdős distinct distances problem in the plane
cites work: The number of crossings in multigraphs with no empty lens
cites work: Q4530626
cites work: Crossings Between Non-homotopic Edges
cites work: A crossing lemma for multigraphs
cites work: Toward a theory of planarity: Hanani-Tutte and planarity variants
cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry
cites work: Toward a theory of crossing numbers
Recommended article: On the separation number of a graph
Recommended article: On the Number of Disjoint Edges in a Graph
Recommended article: Entangled Graphs
Recommended article: On the number of edges in some graphs
Recommended article: On the path separation number of graphs
Recommended article: On the number of edges in a graph with many two-hop disjoint paths
Recommended article: On the number of minimal separators in graphs
Recommended article: On the Number of Minimal Separators in Graphs
Recommended article: On the separability of graphs
Recommended article: Disjoint edges in separated hypergraphs
description: scientific article; zbMATH DE number 7551745