Premium
Note on hypergraphs and sphere orders
Author(s) -
Schrijver Alexander
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170206
Subject(s) - mathematics , combinatorics , spheres , euclidean space , euclidean geometry , order (exchange) , space (punctuation) , element (criminal law) , discrete mathematics , geometry , computer science , physics , finance , astronomy , political science , law , economics , operating system
We show that each partial order ≤ of height 2 can be represented by spheres in Euclidean space, where inclusion represents ≤. If each element has at most k elements under it, we can do this in 2 k − 1‐dimensional space. This extends a result (and a method) of Scheinerman for the case k = 2. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom