Universality of random graphs (2008)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: SIAM
- Publisher place: Philadelphia
- Date published: 2008
- Source:
- Título: Proceedings
- Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA
-
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 09 nov. 2024. -
APA
Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168 -
NLM
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 09 ] Available from: https://dl.acm.org/citation.cfm?id=1347168 -
Vancouver
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 09 ] Available from: https://dl.acm.org/citation.cfm?id=1347168 - 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
