A two-player game on graph factors (2004)
- Authors:
- USP affiliated authors: KOHAYAKAWA, YOSHIHARU - IME ; CARMO, RENATO JOSÉ DA SILVA - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
-
ABNT
CARMO, Renato José da Silva et al. A two-player game on graph factors. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf. Acesso em: 24 fev. 2026. , 2004 -
APA
Carmo, R. J. da S., Feder, T., Kohayakawa, Y., Laber, E. S., Motwani, R., O´Callaghan, L., et al. (2004). A two-player game on graph factors. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf -
NLM
Carmo RJ da S, Feder T, Kohayakawa Y, Laber ES, Motwani R, O´Callaghan L, Panigrahy R, Thomas D. A two-player game on graph factors [Internet]. 2004 ;[citado 2026 fev. 24 ] Available from: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf -
Vancouver
Carmo RJ da S, Feder T, Kohayakawa Y, Laber ES, Motwani R, O´Callaghan L, Panigrahy R, Thomas D. A two-player game on graph factors [Internet]. 2004 ;[citado 2026 fev. 24 ] Available from: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf - Dois problemas de busca
- Problema do subgrafo planar otimo
- Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
| 1389020.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
