Cover Image

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meunier, Anthony, Nourine, Lhouari, Vilmin, Simon
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Half-space separation in monophonic convexity
by: Elaroussi, Mohammed, et al.
Published: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
by: Defrain, Oscar, et al.
Published: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)

On the $E$-base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
by: Adaricheva, Kira, et al.
Published: (2025)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
by: Martínez-Sandoval, Leonardo, et al.
Published: (2019)

Computing the $D$-base and $D$-relation in finite closure systems
by: Adaricheva, Kira, et al.
Published: (2024)

Characterizations of graph classes via convex geometries: a survey
by: Dourado, Mitre C., et al.
Published: (2022)

Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)

On the enumeration of signatures of XOR-CNF's
by: Creignou, Nadia, et al.
Published: (2024)

Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Balanced independent sets and colorings of hypergraphs
by: Dhawan, Abhishek
Published: (2023)

A note on hypergraphs with asymmetric Ramsey properties
by: Sviridenkov, Vladimir
Published: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Note on polychromatic coloring of hereditary hypergraph families II
by: Pálvölgyi, Dömötör
Published: (2026)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)

Halfspace separation in geodesic convexity
by: Nair, Niranjan
Published: (2026)

On weighted partial triangulations of convex polygons
by: Blanca, Antonio, et al.
Published: (2026)

M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Characterization of Word-Representable Graphs using Modular Decomposition
by: Dwary, Tithi, et al.
Published: (2024)

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)

Aperiodic monotiles: from geometry to groups
by: Coulbois, Thierry, et al.
Published: (2024)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)

Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024)