Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
On the chromatic number of geometric hypergraphs
Shakhar Smorodinsky
Research output
:
Contribution to journal
›
Article
›
peer-review
46
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the chromatic number of geometric hypergraphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Chromatic number
100%
Hypergraph
100%
Geometric Hypergraphs
100%
Color number
42%
Jordan Region
42%
Finite Family
42%
Axis-parallel Rectangles
28%
Conflict-free Coloring
28%
Hyperedge
28%
Disk-shaped
14%
Tight
14%
Vertex Set
14%
Polynomial-time Algorithm
14%
Asymptotically-tight
14%
Minimum number of Colors
14%
All-subsets
14%
Union Complexity
14%
Constructive Proof
14%
Non-decreasing Functions
14%
Four Color Theorem
14%
Linear Union Complexity
14%
Mathematics
Chromatic Number
100%
Hypergraphs
100%
Finite Family
37%
Polynomial Time
12%
Constructive Proof
12%
Nondecreasing Function
12%
Four Color Theorem
12%
Theorem Iii
12%