Packing and covering triangles in graphs (1991)
- Autor:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Subjects: TEORIA DOS GRAFOS; EMPACOTAMENTO E COBERTURA
- Language: Inglês
- Imprenta:
- Publisher: Impa
- Publisher place: Rio de Janeiro
- Date published: 1991
- Source:
- Título: Atas
- Conference titles: Colóquio Brasileiro de Matemática
-
ABNT
KOHAYAKAWA, Yoshiharu. Packing and covering triangles in graphs. 1991, Anais.. Rio de Janeiro: Impa, 1991. Disponível em: https://repositorio.usp.br/directbitstream/23a8362d-ef16-44e9-bd4b-6ebf0274ba59/3155702.pdf. Acesso em: 10 jan. 2026. -
APA
Kohayakawa, Y. (1991). Packing and covering triangles in graphs. In Atas. Rio de Janeiro: Impa. Recuperado de https://repositorio.usp.br/directbitstream/23a8362d-ef16-44e9-bd4b-6ebf0274ba59/3155702.pdf -
NLM
Kohayakawa Y. Packing and covering triangles in graphs [Internet]. Atas. 1991 ;[citado 2026 jan. 10 ] Available from: https://repositorio.usp.br/directbitstream/23a8362d-ef16-44e9-bd4b-6ebf0274ba59/3155702.pdf -
Vancouver
Kohayakawa Y. Packing and covering triangles in graphs [Internet]. Atas. 1991 ;[citado 2026 jan. 10 ] Available from: https://repositorio.usp.br/directbitstream/23a8362d-ef16-44e9-bd4b-6ebf0274ba59/3155702.pdf - 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 | |
|---|---|---|---|
| 3155702.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
