On the number of r-transitive orientations of G (n, p) (2017)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2017.06.046
- Subjects: MATEMÁTICA DISCRETA; GRAFOS ALEATÓRIOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 61, p. 255-261, 2017
- Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
COLLARES, M. et al. On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.06.046. Acesso em: 10 jan. 2026. , 2017 -
APA
Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2017). On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.06.046 -
NLM
Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046 -
Vancouver
Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046 - Tight Hamilton cycles in random hypergraphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Measures of pseudorandomness for finite sequences: minimal values
- Hitting time of hamilton cycles in random bipartite graphs
- Measures of pseudorandomness for finite sequences: minimum and typical values
- Testing permutation properties through subpermutations
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- The maximum size of a Sidon set contained in sparse random set of integers
- Hypergraphs with many Kneser colorings
Informações sobre o DOI: 10.1016/j.endm.2017.06.046 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2844627.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
