View Item 

Show simple item record

The largest set partitioned by a subfamily of a cover

dc.contributor.authorCompton, Kevin J.en_US
dc.contributor.authorMontenegro, Carlos H.en_US
dc.date.accessioned2006-04-10T13:41:21Z
dc.date.available2006-04-10T13:41:21Z
dc.date.issued1990-07en_US
dc.identifier.citationCompton, Kevin J., Montenegro, Carlos H. (1990/07)."The largest set partitioned by a subfamily of a cover." Journal of Combinatorial Theory, Series A 54(2): 296-303. <http://hdl.handle.net/2027.42/28503>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WHS-4D7D0PS-T9/2/62800e01864ad7a54c89351f2f27108aen_US
dc.identifier.urihttps://hdl.handle.net/2027.42/28503
dc.description.abstractDefine [lambda](n) to be the largest integer such that for each set A of size n and cover J of A, there exist B [subset of or equal to] A and G [subset of or equal to] J such that |B| = [lambda](n) and the restriction of G to B is a partition of B. It is shown that when n [ges] 3. The lower bound is proved by a probabilistic method. A related probabilistic algorithm for finding large sets partitioned by a subfamily of a cover is presented.en_US
dc.format.extent352605 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleThe largest set partitioned by a subfamily of a coveren_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumEECS Department, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/28503/1/0000300.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0097-3165(90)90036-Ven_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Aen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000300.pdf
Size:
344.3KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.