𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved bounds for intersecting triangles and halving planes

✍ Scribed by David Eppstein

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
298 KB
Volume
62
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved bound for extending partial
An improved bound for extending partial projective planes
✍ Stephen Dow πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 895 KB

A partial projective plane S of order n is a collection of subse:(s (called lines) of an (n' + n + l)-set (of points) such that every line has size n + 1 and any two lines meet in a unique point. We denote the number of lines by b. In this paper it is shown that if b > n\* -2(n + 3)f + 6, then 2 can

Improved bounds and algorithms for hyper
Improved bounds and algorithms for hypergraph 2-coloring
✍ Jaikumar Radhakrishnan; Aravind Srinivasan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 2 views

We show that for all large n, every n-uniform hypergraph with at most 0 7 n/ ln n Γ— 2 n edges can be 2-colored. This makes progress on a problem of ErdΕ‘s [Nordisk Mat. Tidskrift 11, 5-10 (1963)], improving the previous-best bound of n 1/3-o 1 Γ— 2 n due to Beck [Discrete Math. 24, 127-137 (1978)]. We