Imagen de Portada

Halfspace separation in geodesic convexity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Nair, Niranjan
Formato:	Preprint
Publicado:	2026
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Separation axiom $S_3$ for geodesic convexity in graphs
por: Chepoi, Victor
Publicado: (2024)

Enumerating all geodesics
por: Wild, Marcel
Publicado: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
por: Bressan, Marco, et al.
Publicado: (2025)

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

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

On open-separating dominating codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

List homomorphisms to separable signed graphs
por: Bok, Jan, et al.
Publicado: (2023)

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

On coarse tree decompositions and coarse balanced separators
por: Abrishami, Tara, et al.
Publicado: (2025)

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

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
por: Meunier, Anthony, et al.
Publicado: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
por: Pilipczuk, Marcin, et al.
Publicado: (2023)

On full-separating sets and related codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Weakly toll convexity and proper interval graphs
por: Dourado, Mitre C., et al.
Publicado: (2022)

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

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

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

Excluding an apex-forest or a fan as quickly as possible
por: Claus, Quentin, et al.
Publicado: (2026)

On Patterns and Languages in 1-11-Representations of Graphs
por: Das, Biswajit, et al.
Publicado: (2026)

The Dominating 4-Colour Theorem
por: Girão, António, et al.
Publicado: (2026)

Size-4 Counterexamples to the Sidon-Extension Conjecture
por: Niu, Tong
Publicado: (2026)

Matchings in permutations
por: Inozemtsev, Eduard, et al.
Publicado: (2026)

Approximating the Network Design Problem for Potential-Based Flows
por: Klimm, Max, et al.
Publicado: (2026)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
por: Karol, Nikolai, et al.
Publicado: (2026)

On the $(\leq p)$-inversion diameter of oriented graphs
por: Havet, Frédéric, et al.
Publicado: (2026)

The Normal Domination Partizan Game in Stars
por: Sampaio, Rudini, et al.
Publicado: (2026)

Improving SAT Solvers on Orthogonal Latin Square Problems
por: Barnoff, Aaron, et al.
Publicado: (2026)

Bounds on Linear Turán Number for Trees
por: Adak, Rajat, et al.
Publicado: (2026)

Word-Representation of Melon Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2026)

Completely Independent Steiner Trees
por: Maheshwari, Anil, et al.
Publicado: (2026)

Binomial Random Matroids
por: Bennett, Patrick, et al.
Publicado: (2026)

A note on hypergraphs with asymmetric Ramsey properties
por: Sviridenkov, Vladimir
Publicado: (2026)

Enumerating Two-Orbit Graphs
por: Seka, David, et al.
Publicado: (2026)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
por: Sanghi, Aryan, et al.
Publicado: (2026)

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

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
por: Gerke, S., et al.
Publicado: (2026)

An improvement on the bound for the acyclic chromatic index
por: Kirousis, Lefteris, et al.
Publicado: (2026)

Word-Representability of Shift Graphs
por: Roy, Suchanda, et al.
Publicado: (2026)

The red-blue-yellow matching problem
por: Aprile, Manuel, et al.
Publicado: (2026)

Clique-width and induced topological minors
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)