## Abstract A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We give the final steps in the proof of the conjecture that the minimum number of triples in a tight 3‐graph on __n__ vertices is exactly $\left\lceil n(n-2)/3 \
Bounding the size of near hexagons with lines of size 3
✍ Scribed by Bart De Bruyn
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 150 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We consider finite near hexagons with lines of size 3, and prove that there are only finitely many examples given the nondegeneracy condition that for each point there exists a point at distance 3 to it. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 108–122, 2006
📜 SIMILAR VOLUMES
It is shown that the size-frequency distribution (SFD) of a timeaveraged projectile population derived from the lunar crater SFD of Neukum and Ivanov (in Hazards Due to Comets and Asteroids (T. Gehrels, Ed.), 1994, pp. 359-416, Univ. of Arizona Press, Tucson) provides a convincing fit to the SFD of
## Abstract A graph __G__ is __k‐choosable__ if its vertices can be colored from any lists __L__(ν) of colors with |__L__(ν)| ≥ __k__ for all ν ∈ __V__(__G__). A graph __G__ is said to be (__k,ℓ__)‐__choosable__ if its vertices can be colored from any lists __L__(ν) with |__L__(ν)| ≥__k__, for all
**The synthesis of nanocrystalline PbS quantum dots** using organometallic precursors is reported. The samples exhibit tunable, strong near‐infrared photoluminescence. A remarkable spontaneous self‐directed narrowing of the particle size distribution is shown to occur after the particles are synthes