Zobrazit minimální záznam



dc.contributor.authorHancock R.
dc.contributor.authorKabela A.
dc.contributor.authorKraľ D.
dc.contributor.authorMartins T.
dc.contributor.authorParente R.
dc.contributor.authorSkerman F.
dc.contributor.authorVolec J.
dc.date.accessioned2023-04-02T20:19:36Z
dc.date.available2023-04-02T20:19:36Z
dc.date.issued2023
dc.identifierV3S-365856
dc.identifier.citationHANCOCK, R., et al. No additional tournaments are quasirandom-forcing. European Journal of Combinatorics. 2023, 108 ISSN 0195-6698. DOI 10.1016/j.ejc.2022.103632.
dc.identifier.issn0195-6698 (print)
dc.identifier.issn1095-9971 (online)
dc.identifier.urihttp://hdl.handle.net/10467/107797
dc.description.abstractA tournament H is quasirandom-forcing if the following holds for every sequence (G_n) is an element of N of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is an element of N is quasirandom. Every transitive tournament with at least 4 vertices is quasirandom-forcing, and Coregliano (2019) showed that there is also a non-transitive 5-vertex tournament with the property. We show that no additional tournament has this property. This extends the result of Bucic (2021) that the non-transitive tournaments with seven or more vertices do not have this property.eng
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofEuropean Journal of Combinatorics
dc.subjectQuasi-randomnesseng
dc.subjectTournamenteng
dc.subjectExtremal graph theoryeng
dc.titleNo additional tournaments are quasirandom-forcingeng
dc.typečlánek v časopisecze
dc.typejournal articleeng
dc.identifier.doi10.1016/j.ejc.2022.103632
dc.rights.accessopenAccess
dc.identifier.wos000878718300005
dc.type.statusPeer-reviewed
dc.type.versionacceptedVersion
dc.identifier.scopus2-s2.0-85140319594


Soubory tohoto záznamu


Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam