Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
type: Item
instance of: scholarly article
title: Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
zbMATH Open document ID: 1542.05043
author: Jacob Fox
author: János Pach
author: Andrew Suk
published in: European Journal of Combinatorics
publication date: 2024-06-28T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 52C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7873133
zbMATH Keywords: graph separators
zbMATH Keywords: planar graphs
zbMATH Keywords: spectral partitioning
MaRDI profile type: MaRDI publication profile
cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges
cites work: Quasi-planar Graphs
cites work: On the maximum number of edges in quasi-planar graphs
cites work: Quasi-planar graphs have a linear number of edges
cites work: On a Coloring Problem.
cites work: Research Problems in Discrete Geometry
cites work: Coloring and Maximum Weight Independent Set of Rectangles
cites work: Improved bounds for colouring circle graphs
cites work: Circle graphs are quadratically χ‐bounded
cites work: On generalized Ramsey numbers of Erdős and Rogers
cites work: On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
cites work: Q3284375
cites work: The Construction of Certain Graphs
cites work: Separator theorems and Turán-type results for planar intersection graphs
cites work: A Separator Theorem for String Graphs and its Applications
cites work: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
cites work: String graphs and incomparability graphs
cites work: Applications of a New Separator Theorem for String Graphs
cites work: On the chromatic number of multiple interval graphs and overlap graphs
cites work: Improved bounds for the Erdős-Rogers function
cites work: Covering and coloring polygon-circle graphs
cites work: On-line approach to off-line coloring problems on graphs with geometric representations
cites work: Ks-Free Graphs Without Large Kr-Free Subgraphs
cites work: Bounding Ramsey numbers through large deviation inequalities
cites work: Separators in region intersection graphs
cites work: Generalized Nested Dissection
cites work: Colouring arcwise connected sets in the plane. I
cites work: Q3886431
cites work: Q5477819
cites work: Triangle-free intersection graphs of line segments with large chromatic number
cites work: Coloring curves that cross a fixed curve
cites work: Outerstring Graphs are $\chi$-Bounded
cites work: Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
cites work: Coloring intersection graphs of \(x\)-monotone curves in the plane
cites work: String graphs have the Erdős-Hajnal property
cites work: On geometric graphs with no \(k\) pairwise parallel edges
cites work: Triangle-free geometric intersection graphs with no large independent sets
cites work: \(K_4\)-free graphs without large induced triangle-free subgraphs
DOI: 10.1016/J.EJC.2023.103811
description: scientific article; zbMATH DE number 7873133