A proof of Frankl's conjecture on cross-union families

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 79
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCambie, Stijnko
dc.contributor.authorKim, Jaehoonko
dc.contributor.authorLiu, Hongko
dc.contributor.authorTran, Tuanko
dc.date.accessioned2023-11-28T00:00:16Z-
dc.date.available2023-11-28T00:00:16Z-
dc.date.created2023-11-27-
dc.date.issued2023-09-
dc.identifier.citationCombinatorial Theory, v.3, no.2-
dc.identifier.issn2766-1334-
dc.identifier.urihttp://hdl.handle.net/10203/315266-
dc.description.abstractThe 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.languageEnglish-
dc.publishereScholarship Publishing-
dc.titleA proof of Frankl's conjecture on cross-union families-
dc.typeArticle-
dc.identifier.scopusid2-s2.0-85171445634-
dc.type.rimsART-
dc.citation.volume3-
dc.citation.issue2-
dc.citation.publicationnameCombinatorial Theory-
dc.identifier.doi10.5070/c63261987-
dc.contributor.localauthorKim, Jaehoon-
dc.contributor.nonIdAuthorCambie, Stijn-
dc.contributor.nonIdAuthorLiu, Hong-
dc.contributor.nonIdAuthorTran, Tuan-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0