Name
Abstract | ||
|---|---|---|
Abstract Consider a geometric,graph,given by n points in the plane (in general position) and m line segments, each segment joining a pair of the given points. We show,that: if m � 3n + 1 then there are 3 pairwise disjoint segments; if m � 10n + 1 then there are 4 disjoint segments; and if m � ckn(logn),,4 then there are k disjoint segments. 3 |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/eujc.1996.0032 | Eur. J. Comb. |
Keywords | Field | DocType |
disjoint segment,geometric graph | Combinatorics,General position,Disjoint sets,Spatial network,Forcing (mathematics),Mathematics | Journal |
Volume | Issue | ISSN |
17 | 4 | 0195-6698 |
Citations | PageRank | References |
7 | 2.09 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne Goddard | 1 | 14 | 3.03 |
| Meir Katchalski | 2 | 69 | 14.88 |
| Daniel J. Kleitman | 3 | 854 | 277.98 |