Author:
P. E. Haxell Department of Pure Mathematics and Mathematical Statistics University of Cambridge 16 Mill Lane CB2 1SB Cambridge England

Search for other papers by P. E. Haxell in
Current site
Google Scholar
PubMed
Close
Restricted access

A special case of a conjecture of Ryser states that if a 3-partite 3-uniform hypergraph has at mostv pairwise disjoint edges then there is a set of vertices of cardinality at most 2v meeting all edges of the hypergraph. The best known upper bound for the size of such a set is (8/3)v, given by Tuza [7]. In this note we improve this to (5/2)v.

  • Collapse
  • Expand

To see the editorial board, please visit the website of Springer Nature.

Manuscript Submission: HERE

For subscription options, please visit the website of Springer Nature.

Periodica Mathematica Hungarica
Language English
Size B5
Year of
Foundation
1971
Volumes
per Year
2
Issues
per Year
4
Founder Bolyai János Matematikai Társulat - János Bolyai Mathematical Society
Founder's
Address
H-1055 Budapest, Hungary Falk Miksa u. 12.I/4.
Publisher Akadémiai Kiadó
Springer Nature Switzerland AG
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0031-5303 (Print)
ISSN 1588-2829 (Online)

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Apr 2024 6 0 0
May 2024 1 0 0
Jun 2024 2 0 1
Jul 2024 1 0 1
Aug 2024 2 0 0
Sep 2024 4 0 1
Oct 2024 6 0 0