Title	Coloring hypergraphs defined by pseudo-disks
Creator	Keszegh, Balázs
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-02-06T14:13
Description	We present several results about coloring geometric hypergraphs that are defined by pseudo-disk arrangements. In particular, we prove that the intersection hypergraph of a finite family of pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with 4 colors. Along the way we prove that the corresponding Delaunay-graph is planar. Our results serve as a common generalization and strengthening of many earlier results, including ones about coloring points with respect to pseudo-disks, coloring pseudo-disks with respect to points and coloring disks with respect to disks.
Extent	35 minutes
Subject	Mathematics; Convex and discrete geometry; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Alfréd Rényi Institute of Mathematics
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-08-06
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0369716
URI	http://hdl.handle.net/2429/66672
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos