The shifted Turán sieve method on tournaments II.

dc.contributor.authorKuo, Wentang
dc.contributor.authorLiu, Yu-Ru
dc.contributor.authorRibas, Sávio
dc.contributor.authorZhou, Kevin
dc.date.accessioned2023-02-06T21:09:48Z
dc.date.available2023-02-06T21:09:48Z
dc.date.issued2021pt_BR
dc.description.abstractIn 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.pt_BR
dc.identifier.citationKUO, W. et al. The shifted Turán sieve method on tournaments II. Discrete Mathematics, v. 344, n. 12, p. 112602, 2021. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0012365X21003150>. Acesso em: 06 jul. 2022.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.disc.2021.112602pt_BR
dc.identifier.issn0012-365X
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/16121
dc.identifier.uri2https://www.sciencedirect.com/science/article/pii/S0012365X21003150pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectBipartite tournamentspt_BR
dc.subject3-cyclespt_BR
dc.titleThe shifted Turán sieve method on tournaments II.pt_BR
dc.typeArtigo publicado em periodicopt_BR

Arquivos

Pacote original

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
ARTIGO_ShiftedTuránSieve.pdf
Tamanho:
321.66 KB
Formato:
Adobe Portable Document Format
Descrição:

Licença do pacote

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: