Image de couverture de livre

Halfspace separation in geodesic convexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Nair, Niranjan
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Separation axiom $S_3$ for geodesic convexity in graphs
par: Chepoi, Victor
Publié: (2024)

Enumerating all geodesics
par: Wild, Marcel
Publié: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
par: Bressan, Marco, et autres
Publié: (2025)

Half-space separation in monophonic convexity
par: Elaroussi, Mohammed, et autres
Publié: (2024)

On weighted partial triangulations of convex polygons
par: Blanca, Antonio, et autres
Publié: (2026)

On open-separating dominating codes in graphs
par: Chakraborty, Dipayan, et autres
Publié: (2024)

List homomorphisms to separable signed graphs
par: Bok, Jan, et autres
Publié: (2023)

M-convexity of the minimum-cost packings of arborescences
par: Takazawa, Kenjiro
Publié: (2018)

On coarse tree decompositions and coarse balanced separators
par: Abrishami, Tara, et autres
Publié: (2025)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
par: Martínez-Sandoval, Leonardo, et autres
Publié: (2019)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

On full-separating sets and related codes in graphs
par: Chakraborty, Dipayan, et autres
Publié: (2024)

Weakly toll convexity and proper interval graphs
par: Dourado, Mitre C., et autres
Publié: (2022)

Characterizations of graph classes via convex geometries: a survey
par: Dourado, Mitre C., et autres
Publié: (2022)

Translating between the representations of an acyclic convex geometry of bounded degree
par: Defrain, Oscar, et autres
Publié: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
par: Bastida, Sam, et autres
Publié: (2026)

Excluding an apex-forest or a fan as quickly as possible
par: Claus, Quentin, et autres
Publié: (2026)

On Patterns and Languages in 1-11-Representations of Graphs
par: Das, Biswajit, et autres
Publié: (2026)

The Dominating 4-Colour Theorem
par: Girão, António, et autres
Publié: (2026)

Size-4 Counterexamples to the Sidon-Extension Conjecture
par: Niu, Tong
Publié: (2026)

Matchings in permutations
par: Inozemtsev, Eduard, et autres
Publié: (2026)

Approximating the Network Design Problem for Potential-Based Flows
par: Klimm, Max, et autres
Publié: (2026)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
par: Karol, Nikolai, et autres
Publié: (2026)

On the $(\leq p)$-inversion diameter of oriented graphs
par: Havet, Frédéric, et autres
Publié: (2026)

The Normal Domination Partizan Game in Stars
par: Sampaio, Rudini, et autres
Publié: (2026)

Improving SAT Solvers on Orthogonal Latin Square Problems
par: Barnoff, Aaron, et autres
Publié: (2026)

Bounds on Linear Turán Number for Trees
par: Adak, Rajat, et autres
Publié: (2026)

Word-Representation of Melon Graphs
par: Mozhui, Khyodeno, et autres
Publié: (2026)

Completely Independent Steiner Trees
par: Maheshwari, Anil, et autres
Publié: (2026)

Binomial Random Matroids
par: Bennett, Patrick, et autres
Publié: (2026)

A note on hypergraphs with asymmetric Ramsey properties
par: Sviridenkov, Vladimir
Publié: (2026)

Enumerating Two-Orbit Graphs
par: Seka, David, et autres
Publié: (2026)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
par: Sanghi, Aryan, et autres
Publié: (2026)

Centered colorings and weak coloring numbers in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2026)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
par: Gerke, S., et autres
Publié: (2026)

An improvement on the bound for the acyclic chromatic index
par: Kirousis, Lefteris, et autres
Publié: (2026)

Word-Representability of Shift Graphs
par: Roy, Suchanda, et autres
Publié: (2026)

The red-blue-yellow matching problem
par: Aprile, Manuel, et autres
Publié: (2026)

Clique-width and induced topological minors
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)