Image de couverture de livre

Unavoidable patterns and plane paths in dense topological graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Keszegh, Balázs, Suk, Andrew, Tardos, Gábor, Zeng, Ji
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A new discrete theory of pseudoconvexity
par: Keszegh, Balázs
Publié: (2022)

On the number of tangencies among $1$-intersecting $x$-monotone curves
par: Ackerman, Eyal, et autres
Publié: (2023)

On dual-ABAB-free and related hypergraphs
par: Keszegh, Balázs, et autres
Publié: (2024)

Coloring Geometric Hypergraphs: A Survey
par: Damásdi, Gábor, et autres
Publié: (2025)

The maximum number of digons formed by pairwise crossing pseudocircles
par: Ackerman, Eyal, et autres
Publié: (2024)

On the number of digons in arrangements of pairwise intersecting circles
par: Ackerman, Eyal, et autres
Publié: (2024)

The Zarankiewicz Problem for Polygon Visibility Graphs
par: Ackerman, Eyal, et autres
Publié: (2025)

On the maximum number of tangencies among $1$-intersecting curves
par: Ackerman, Eyal, et autres
Publié: (2026)

On Triangles in Colored Pseudoline Arrangements
par: Radtke, Yan Alves, et autres
Publié: (2026)

What induces plane structures in complete graph drawings?
par: Weinberger, Alexandra, et autres
Publié: (2026)

Piercing all maximum cliques in hypergraphs
par: Holmsen, Andreas, et autres
Publié: (2026)

Saturation of edge-ordered graphs
par: Bošković, Vladimir, et autres
Publié: (2024)

Crossing numbers of dense graphs on surfaces
par: Hubard, Alfredo, et autres
Publié: (2025)

On cliques in three-dimensional dense point-line arrangements
par: Suk, Andrew, et autres
Publié: (2023)

Query complexity of Boolean functions on the middle slice of the cube
par: Gerbner, Dániel, et autres
Publié: (2023)

3-uniform monotone paths and multicolor Ramsey numbers
par: Suk, Andrew, et autres
Publié: (2024)

On edge-ordered graphs with linear extremal functions
par: Kucheriya, Gaurav, et autres
Publié: (2023)

Total domination in plane triangulations
par: Claverol, M., et autres
Publié: (2020)

Unavoidable patterns in $2$-colorings of the complete bipartite graph
par: Hansberg, Adriana, et autres
Publié: (2024)

Covering half-grids with lines and planes
par: Bishnoi, Anurag, et autres
Publié: (2025)

A Purely Geometric Variant of the Gale-Berlekamp Switching Game
par: Dumitrescu, Adrian, et autres
Publié: (2025)

Is the space of reachable particle configurations dense?
par: Pach, Janos, et autres
Publié: (2025)

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
par: Biedl, Therese
Publié: (2025)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
par: Fabila-Monroy, Ruy, et autres
Publié: (2024)

General penny graphs are at most 43/18-dense
par: Sagdeev, Arsenii
Publié: (2024)

The complexity of recognizing $ABAB$-free hypergraphs
par: Damásdi, Gábor, et autres
Publié: (2024)

Orientation of convex sets
par: Ágoston, Péter, et autres
Publié: (2022)

Orientation of good covers
par: Ágoston, Péter, et autres
Publié: (2022)

Separators for intersection graphs of spheres
par: Fox, Jacob, et autres
Publié: (2026)

On plane cycles in geometric multipartite graphs
par: Ricci, Marco, et autres
Publié: (2025)

Intersection patterns in spaces with a forbidden homological minor
par: Goaoc, Xavier, et autres
Publié: (2021)

Bounding and computing obstacle numbers of graphs
par: Balko, Martin, et autres
Publié: (2022)

A stellated tetrahedron that is probably not Rupert
par: Zeng, Tony
Publié: (2026)

On saturated triangulation-free convex geometric graphs
par: Garber, David, et autres
Publié: (2025)

On the number of edges in saturated partial embeddings of maximal planar graphs
par: Barát, János, et autres
Publié: (2025)

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
par: Davies, James, et autres
Publié: (2024)

Sublevels in arrangements and the spherical arc crossing number of complete graphs
par: Streltsova, Elizaveta, et autres
Publié: (2025)

Piercing independent sets in graphs without large induced matching
par: Ai, Jiangdong, et autres
Publié: (2024)

A census of graph-drawing algorithms based on generalized transversal structures
par: Bernardi, Olivier, et autres
Publié: (2024)

Penny graphs in the hyperbolic plane
par: Sagmeister, Ádám, et autres
Publié: (2025)