Imagen de Portada

An Improved Lower Bound on the Number of Pseudoline Arrangements

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kühnast, Fernando Cortés, Dallant, Justin, Felsner, Stefan, Scheucher, Manfred
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Computational Geometry Discrete Mathematics G.2.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Lower Bound on the Number of Pseudoline Arrangements
por: Dallant, Justin
Publicado: (2024)

Arrangements of Pseudocircles: On Digons and Triangles
por: Felsner, Stefan, et al.
Publicado: (2022)

Plane Hamiltonian Cycles in Convex Drawings
por: Bergold, Helena, et al.
Publicado: (2024)

Dyck Paths Enumerated by the Q-bonacci Numbers
por: Barcucci, Elena, et al.
Publicado: (2024)

Optimal covering of rectangular grid graphs with tours of constrained length
por: Bereg, Sergey, et al.
Publicado: (2025)

Investigating Simple Drawings of $K_n$ using SAT
por: Bergold, Helena, et al.
Publicado: (2025)

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem
por: Dallant, Justin
Publicado: (2025)

A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
por: Schager, Florian, et al.
Publicado: (2024)

The Converse of the Real Orthogonal Holant Theorem
por: Young, Ben
Publicado: (2024)

On The Roots of Independence Polynomial: Quantifying The Gap
por: Prakash, Om, et al.
Publicado: (2025)

Binary Words Containing Few Abelian Squares
por: Fazekas, Szilard Zsolt, et al.
Publicado: (2026)

Extending Wormald's Differential Equation Method to One-sided Bounds
por: Bennett, Patrick, et al.
Publicado: (2023)

The Hierarchy of Saturating Matching Numbers
por: Simon, Hans U., et al.
Publicado: (2025)

Topological Drawings meet Classical Theorems from Convex Geometry
por: Bergold, Helena, et al.
Publicado: (2020)

Combinatorics of rectangulations: Old and new bijections
por: Asinowski, Andrei, et al.
Publicado: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
por: Bom, David, et al.
Publicado: (2025)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
por: Cavallaro, Dario, et al.
Publicado: (2026)

Facet-Hamiltonicity
por: Akitaya, Hugo, et al.
Publicado: (2024)

Improved Upper Bounds for Slicing the Hypercube
por: Soiffer, Duncan, et al.
Publicado: (2026)

Breaking the Symmetries of Amenable Graphs
por: Cheng, Christine T.
Publicado: (2025)

Erdős Matching (Conjecture) Theorem
por: Mishra, Tapas Kumar
Publicado: (2026)

Helly-type problems from a topological perspective
por: Paták, Pavel, et al.
Publicado: (2026)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
por: Charvy, Gaspard, et al.
Publicado: (2025)

Constructions, bounds, and algorithms for peaceable queens
por: Clinch, Katie, et al.
Publicado: (2024)

Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
por: Dong, Shiying
Publicado: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
por: Streit, Robert P., et al.
Publicado: (2024)

Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete
por: Koepke, Finn Orson
Publicado: (2025)

Almost optimum $\ell$-covering of $\mathbb{Z}_n$
por: Shi, Ke, et al.
Publicado: (2022)

Locked Polyomino Tilings
por: Tucker-Foltz, Jamie
Publicado: (2023)

WELLDOC property for words generated by morphisms
por: Puzynina, Svetlana, et al.
Publicado: (2026)

New Results on Edge-coloring and Total-coloring of Split Graphs
por: Couto, Fernanda, et al.
Publicado: (2023)

Patrolling Grids with a Bit of Memory
por: Amir, Michael, et al.
Publicado: (2023)

Bounds on the Number of Pieces in Continuous Piecewise Affine Functions
por: Zanotti, Leo
Publicado: (2025)

On the Metric Dimension of $K_a \times K_b \times K_c$
por: Gledel, Valentin, et al.
Publicado: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

On the Alon-Tarsi Number of Some Line and Total graphs
por: Prajnanaswaroopa, S.
Publicado: (2023)

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
por: Blanco, Saúl A., et al.
Publicado: (2023)

A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
por: De, Koustav
Publicado: (2025)