Geodesic
On Ryser's conjecture
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Motivated by an old problem known as Ryser's Conjecture, we prove that for $r=4$ and $r=5$, there exists $\epsilon>0$ such that every $r$-partite $r$-uniform hypergraph $\cal H$ has a cover of size at most $(r-\epsilon)\nu(\cal H)$, where $\nu(\cal H)$ denotes the size of a largest matching in $\cal H$.
DOI : 10.37236/1175
Classification : 05C70, 05C65, 05C35
Mots-clés : largest matching 
@article{10_37236_1175,
     author = {P. E. Haxell and A. D. Scott},
     title = {On {Ryser's} conjecture},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {1},
     doi = {10.37236/1175},
     zbl = {1243.05198},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1175/}
}
TY  - JOUR
AU  - P. E. Haxell
AU  - A. D. Scott
TI  - On Ryser's conjecture
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1175/
DO  - 10.37236/1175
ID  - 10_37236_1175
ER  - 
%0 Journal Article
%A P. E. Haxell
%A A. D. Scott
%T On Ryser's conjecture
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1175/
%R 10.37236/1175
%F 10_37236_1175
P. E. Haxell; A. D. Scott. On Ryser's conjecture. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/1175

Cité par Sources :