Intersecting designs from linear programming and graphs of diameter two

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We investigate 1-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.

Original languageEnglish
Pages (from-to)187-207
Number of pages21
JournalDiscrete Mathematics
Volume127
Issue number1-3
DOIs
Publication statusPublished - Mar 15 1994

Fingerprint

Linear programming
Intersecting Family
Finite Geometry
Uniform Hypergraph
Graph in graph theory
Projective plane
Open Problems
Corollary
Fractional
Configuration
Geometry
Design

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Intersecting designs from linear programming and graphs of diameter two. / Füredi, Z.

In: Discrete Mathematics, Vol. 127, No. 1-3, 15.03.1994, p. 187-207.

Research output: Contribution to journalArticle

@article{19bf53797fa04a75b70ff1531020ade4,
title = "Intersecting designs from linear programming and graphs of diameter two",
abstract = "We investigate 1-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.",
author = "Z. F{\"u}redi",
year = "1994",
month = "3",
day = "15",
doi = "10.1016/0012-365X(92)00478-A",
language = "English",
volume = "127",
pages = "187--207",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Intersecting designs from linear programming and graphs of diameter two

AU - Füredi, Z.

PY - 1994/3/15

Y1 - 1994/3/15

N2 - We investigate 1-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.

AB - We investigate 1-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.

UR - http://www.scopus.com/inward/record.url?scp=38149145986&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149145986&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(92)00478-A

DO - 10.1016/0012-365X(92)00478-A

M3 - Article

VL - 127

SP - 187

EP - 207

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -