skip to main content
Idioma:
Mostrar Somente
Refinado por: assunto: Teoria Dos Grafos remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
On the number of orientations of random graphs with no directed cycles of a given length
On the number of orientations of random graphs with no directed cycles of a given length
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the number of orientations of random graphs with no directed cycles of a given length

Peter Allen Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Roberto Freitas Parente

Electronic Journal of Combinatorics San Marcos v. 21, n. 1, P1.52, 2014

San Marcos 2014

Localização: IME - Inst. Matemática e Estatística    (PROD-2499508 )(Acessar)

2
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Wiebke Bedenknecht Jie Han; Yoshiharu Kohayakawa; Guilherme Oliveira Mota

Random Structures & Algorithms New York v. 55, n. 4, p. 795-807, 2019

New York 2019

Localização: IME - Inst. Matemática e Estatística    (PROD-2976213 )(Acessar)

3
The size-Ramsey number of powers of bounded degree trees
The size-Ramsey number of powers of bounded degree trees
Material Type:
Artigo 		Adicionar ao Meu Espaço

The size-Ramsey number of powers of bounded degree trees

Sören Berger Yoshiharu Kohayakawa; Giulia Satiko Maesaka; Taísa Martins; Walner Mendonça; Guilherme Oliveira Mota; Olaf Parczyk

Journal of the London Mathematical Society Chichester v. 103, n. 4, p. 1314-1332, 2021

Chichester 2021

Localização: IME - Inst. Matemática e Estatística    (PROD-3020479 )(Acessar)

4
The size-Ramsey number of powers of bounded degree trees
The size-Ramsey number of powers of bounded degree trees
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

The size-Ramsey number of powers of bounded degree trees

Sören Berger Yoshiharu Kohayakawa; Giulia Satiko Maesaka; Taísa Martins; Walner Mendonça; Guilherme Oliveira Mota; Olaf Parczyk; European Conference On Combinatorics, Graph Theory And Applications - EUROCOMB (10. 2019 Bratislava, Slovakia)

Acta mathematica Universitatis Comenianae Bratislava v. 88, n. 3, p. 451-456, 2019

Bratislava Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského 2019

Acesso online. A biblioteca também possui exemplares impressos.

5
Decompositions of highly connected graphs into paths of any given length
Decompositions of highly connected graphs into paths of any given length
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Decompositions of highly connected graphs into paths of any given length

F Botler G. O Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; European Conference on Combinatorics, Graph Theory and Applications - EuroComb (8. 2015 Bergen)

Electronic Notes in Discrete Mathematics Amsterdam v. 49. p. 795-802, Nov. 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2736947 )(Acessar)

6
Path decompositions of regular graphs with prescribed girth
Path decompositions of regular graphs with prescribed girth
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Path decompositions of regular graphs with prescribed girth

F Botler G. O Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; European Conference on Combinatorics, Graph Theory and Applications - EuroComb (8. 2015 Bergen)

Electronic Notes in Discrete Mathematics Amsterdam v. 49. p. 629-636, Nov. 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2736946 )(Acessar)

7
Decompositions of triangle-free 5-regular graphs into paths of length five
Decompositions of triangle-free 5-regular graphs into paths of length five
Material Type:
Artigo 		Adicionar ao Meu Espaço

Decompositions of triangle-free 5-regular graphs into paths of length five

Fábio Happ Botler Guilherme Oliveira Mota; Yoshiko Wakabayashi

Discrete Mathematics Amsterdam v. 338, n. 11, p. 1845–1855, 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2699894 )(Acessar)

8
Decomposing highly edge-connected graphs into paths of any given length
Decomposing highly edge-connected graphs into paths of any given length
Material Type:
Artigo 		Adicionar ao Meu Espaço

Decomposing highly edge-connected graphs into paths of any given length

Fábio Happ Botler Guilherme Oliveira Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi

Journal of Combinatorial Theory, Series B Dulluth v. 122, p. 508-542, 2017

Dulluth 2017

Localização: IME - Inst. Matemática e Estatística    (PROD-2840621 )(Acessar)

9
Decomposing highly connected graphs into paths of length five
Decomposing highly connected graphs into paths of length five
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Decomposing highly connected graphs into paths of length five

Fábio Happ Botler Guilherme Oliveira Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS (8. 2015 Fortaleza, Brasil)

Discrete Applied Mathematics Amsterdam v. 245, p. 128-138, 2018

Amsterdam 2018

Localização: IME - Inst. Matemática e Estatística    (PROD-2872520 )(Acessar)

10
Decompositions of highly connected graphs into paths of length five
Decompositions of highly connected graphs into paths of length five
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Decompositions of highly connected graphs into paths of length five

Fábio Happ Botler Guilherme Oliveira Mota; Marcio Takashi Iura Oshiro; Yoshiko Wakabayashi; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (8. 2015 Beberibe)

Electronic Notes in Discrete Mathematics Amsterdam v. 50, p. 211-216, Dec. 2015

Amsterdam 2015

Localização: IME - Inst. Matemática e Estatística    (PROD-2739534 )(Acessar)

Personalize Seus Resultados

  1. Editar

Refine Search Results

Mostrar Somente

  1. Recursos Online (2)

Novas Pesquisas Sugeridas

Ignorar minha busca e procurar por tudo

Deste Autor:

  1. Mota, G
  2. Kohayakawa, Y
  3. Botler, F
  4. Wakabayashi, Y
  5. Oshiro, M

Neste Assunto:

  1. Combinatória
  2. Grafos Aleatórios
  3. Teoria De Ramsey

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.