Intersection Representations of the Complete Bipartite Graph

Zoltán Füredi ()
Additional contact information
Zoltán Füredi: Department of Mathematics

A chapter in The Mathematics of Paul Erdős II, 2013, pp 127-134 from Springer

Abstract: Summary A p-representation of the complete graph $$\mathcal{K}_{n,n}$$ is a collection of sets $$\{S_{1},S_{2},\ldots\;,S_{2n}\}$$ such that $$\vert S_{i} \cap S_{j}\vert \geq p$$ if and only if i ≤ n

Keywords: Complete Bipartite Graph; Uncrowded Hypergraphs; Steiner System; Bounded Degree Trees; Disjoint Independent Sets (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().