The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family (2017)
- Authors:
- USP affiliated authors: KOHAYAKAWA, YOSHIHARU - IME ; HAN, JIE - IME
- Unidade: IME
- DOI: 10.1090/proc/13221
- Subjects: TEORIA DOS GRAFOS; COMBINATÓRIA
- Keywords: intersecting families; Hilton--Milner theorem; Erd\H{o}s--Ko--Rado theorem
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Providence
- Date published: 2017
- Source:
- Título: Proceedings of the American Mathematical Society
- ISSN: 0002-9939
- Volume/Número/Paginação/Ano: v. 145, n. 1, p. 73-87, 2017
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family. Proceedings of the American Mathematical Society, v. 145, n. 1, p. 73-87, 2017Tradução . . Disponível em: https://doi.org/10.1090/proc/13221. Acesso em: 25 fev. 2026. -
APA
Han, J., & Kohayakawa, Y. (2017). The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family. Proceedings of the American Mathematical Society, 145( 1), 73-87. doi:10.1090/proc/13221 -
NLM
Han J, Kohayakawa Y. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family [Internet]. Proceedings of the American Mathematical Society. 2017 ; 145( 1): 73-87.[citado 2026 fev. 25 ] Available from: https://doi.org/10.1090/proc/13221 -
Vancouver
Han J, Kohayakawa Y. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family [Internet]. Proceedings of the American Mathematical Society. 2017 ; 145( 1): 73-87.[citado 2026 fev. 25 ] Available from: https://doi.org/10.1090/proc/13221 - Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
Informações sobre o DOI: 10.1090/proc/13221 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2863255.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
