An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (2008)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Subjects: COMBINATÓRIA; TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: The Electronic Journal of Combinatorics
- ISSN: 1077-8926
- Volume/Número/Paginação/Ano: v. 15, p. 1-15, 2008
-
ABNT
DELLAMONICA JUNIOR, Domingos e KOHAYAKAWA, Yoshiharu. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications. The Electronic Journal of Combinatorics, v. 15, p. 1-15, 2008Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127. Acesso em: 24 abr. 2024. -
APA
Dellamonica Junior, D., & Kohayakawa, Y. (2008). An algorithmic Friedman-Pippenger theorem on tree embeddings and applications. The Electronic Journal of Combinatorics, 15, 1-15. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127 -
NLM
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 abr. 24 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127 -
Vancouver
Dellamonica Junior D, Kohayakawa Y. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications [Internet]. The Electronic Journal of Combinatorics. 2008 ; 15 1-15.[citado 2024 abr. 24 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r127 - A note on induced cycles in kneser graphs
- On K4-free subgraphs of random graphs
- Ramsey games against a one-armed bandit
- Efficient testing of hypergraphs
- Bounds for optimal coverings
- Almost spanning subgraphs of random graphs after adversarial edge removal
- The chromatic thresholds of graphs
- Percolation in high dimensions
- Small subsets inherit sparse ε-regularity
- An improved upper bound on the density of universal random graphs
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
