Covering 3-coloured random graphs with monochromatic trees (2019)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Subjects: COMBINATÓRIA; TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Bratislava
- Date published: 2019
- Source:
- Título: Acta mathematica universitatis comenianae
- ISSN: 0862-9544
- Volume/Número/Paginação/Ano: v. 88, n. 3, p. 871-875, 2019
-
ABNT
KOHAYAKAWA, Yoshiharu et al. Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, v. 88, n. 3, p. 871-875, 2019Tradução . . Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310. Acesso em: 10 jan. 2026. -
APA
Kohayakawa, Y., Mendonça, W., Mota, G. O., & Schülke, B. (2019). Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, 88( 3), 871-875. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310 -
NLM
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.[citado 2026 jan. 10 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310 -
Vancouver
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.[citado 2026 jan. 10 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310 - 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
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2966668.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
