DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cambie, Stijn | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Liu, Hong | ko |
dc.contributor.author | Tran, Tuan | ko |
dc.date.accessioned | 2023-11-28T00:00:16Z | - |
dc.date.available | 2023-11-28T00:00:16Z | - |
dc.date.created | 2023-11-27 | - |
dc.date.issued | 2023-09 | - |
dc.identifier.citation | Combinatorial Theory, v.3, no.2 | - |
dc.identifier.issn | 2766-1334 | - |
dc.identifier.uri | http://hdl.handle.net/10203/315266 | - |
dc.description.abstract | The families F0, …, Fs of k-element subsets of [n]:= {1, 2, …, n} are called cross-union if there is no choice of (Math Presents) such that (Math Presents). A natural generalization of the celebrated Erdős–Ko–Rado theorem, due to Frankl and Tokushige, states that for (Math Presents) the geometric mean of |Fi | is at most (Math Presents). Frankl conjectured that the same should hold for the arithmetic mean under some mild con-ditions. We prove Frankl’s conjecture in a strong form by showing that the unique (up to isomorphism) maximizer for the arithmetic mean of cross-union families is the natural one (Math Presents). | - |
dc.language | English | - |
dc.publisher | eScholarship Publishing | - |
dc.title | A proof of Frankl's conjecture on cross-union families | - |
dc.type | Article | - |
dc.identifier.scopusid | 2-s2.0-85171445634 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3 | - |
dc.citation.issue | 2 | - |
dc.citation.publicationname | Combinatorial Theory | - |
dc.identifier.doi | 10.5070/c63261987 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Cambie, Stijn | - |
dc.contributor.nonIdAuthor | Liu, Hong | - |
dc.contributor.nonIdAuthor | Tran, Tuan | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.