A new discrete theory of pseudoconvexity

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to pseudohalfplanes, including polychromatic colorings and discrete Helly-...

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete mathematics and theoretical computer science Ročník 25:1; číslo Combinatorics; s. 1 - 35
Hlavní autor:	Keszegh, Balázs
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Témata:	Combinatorial analysis computer science - computational geometry Convexity Graph theory Graphs mathematics - combinatorics Theorems Vertex sets
ISSN:	1365-8050, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!