A density result for random sparse oriented graphs and its relation to a conjecture of woodall (2002)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.37236/1661
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Journal of Combinatorics
- ISSN: 1077-8926
- Volume/Número/Paginação/Ano: v. 9, n. 1, p. 1-10, 2002
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
-
ABNT
DONADELLI JUNIOR, Jair e KOHAYAKAWA, Yoshiharu. A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, v. 9, n. 1, p. 1-10, 2002Tradução . . Disponível em: https://doi.org/10.37236/1661. Acesso em: 09 out. 2024. -
APA
Donadelli Junior, J., & Kohayakawa, Y. (2002). A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, 9( 1), 1-10. doi:10.37236/1661 -
NLM
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 out. 09 ] Available from: https://doi.org/10.37236/1661 -
Vancouver
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 out. 09 ] Available from: https://doi.org/10.37236/1661 - A practical minimal perfect hashing method
- Evolution of random subgraphs of the cube
- On Richardson's model on the hypercube
- The Turan theorem for random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Universality and tolerance
- Hereditary properties of triple systems
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- Discrepancy and eigenvalues of Cayley graphs
Informações sobre o DOI: 10.37236/1661 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas