Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

26Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss the maximum size of uniform intersecting families with covering number at least τ. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lovász. The construction for odd k can be visualized on an annulus, while for even k on a Möbius band. © 1996 Academic Press, Inc.

References Powered by Scopus

Intersection theorems for systems of finite sets

1039Citations
N/AReaders
Get full text

Some intersection theorems for systems of finite sets

346Citations
N/AReaders
Get full text

Matchings and covers in hypergraphs

152Citations
N/AReaders
Get full text

Cited by Powered by Scopus

A hilton-milner theorem for vector spaces

45Citations
N/AReaders
Get full text

Invitation to intersection problems for finite sets

43Citations
N/AReaders
Get full text

Guessing secrets

31Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Frankl, P., Ota, K., & Tokushige, N. (1996). Covers in uniform intersecting families and a counterexample to a conjecture of Lovász. Journal of Combinatorial Theory. Series A, 74(1), 33–42. https://doi.org/10.1006/jcta.1996.0035

Readers' Seniority

Tooltip

Professor / Associate Prof. 2

50%

Researcher 2

50%

Readers' Discipline

Tooltip

Mathematics 3

75%

Social Sciences 1

25%

Save time finding and organizing research with Mendeley

Sign up for free