Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7647
Title: Disjoint Union-Free Designs with Block Size Three
Authors: Peter Dukes
Alan C.H. Ling
Issue Date: 2005
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
Abstract: Let n ⩾ k be positive integers. A famous question of Erdos asks for the largest size of a family F of k-subsets of an n-set such that there are no distinct A, B, C, D, ∈ F with A ∩ B = C ∩ D = 𝜑 and A ∪ B = C ∪ D. In the case k = 3, Fiiredi has conjectured that for sufficiently large n, lFl ⩽(n/2) and has constructed a family of examples achieving equality in which F is the block set of a design. Here, we characterize the designs meeting this conjectured bound.
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7647
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Disjoint union-free designs with block size three.pdf
  Restricted Access
2.8 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.