The shifted Turán sieve method on tournaments II.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorKuo, Wentang-
Autor(es): dc.creatorLiu, Yu-Ru-
Autor(es): dc.creatorRibas, Sávio-
Autor(es): dc.creatorZhou, Kevin-
Data de aceite: dc.date.accessioned2025-08-21T15:33:19Z-
Data de disponibilização: dc.date.available2025-08-21T15:33:19Z-
Data de envio: dc.date.issued2023-02-05-
Data de envio: dc.date.issued2023-02-05-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/16121-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S0012365X21003150-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.disc.2021.112602-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1018194-
Descrição: dc.descriptionIn a previous work [5], we developed the shifted Turán sieve method on a bipartite graph and applied it to problems on cycles in tournaments. More precisely, we obtained upper bounds for the number of tournaments which contain a small number of r-cycles. In this paper, we improve our sieve inequality and apply it to obtain an upper bound for the number of bipartite tournaments which contain a number of 2r-cycles far from the average. We also provide the exact bound for the number of tournaments which contain few 3- cycles, using other combinatorial arguments.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectBipartite tournaments-
Palavras-chave: dc.subject3-cycles-
Título: dc.titleThe shifted Turán sieve method on tournaments II.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.