Search Results - Guilherme Oliveira Mota

Refine Results
  1. 21
    The size-Ramsey number of 3-uniform tight paths

    The size-Ramsey number of 3-uniform tight paths by Han, Jie, Kohayakawa, Yoshiharu, Letzter, Shoham, Mota, Guilherme Oliveira, Parczyk, Olaf

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 22
    Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version

    Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version by de Oliveira Bastos, Josefran, Mota, Guilherme Oliveira, Schacht, Mathias, Schnitzer, Jakob, Schulenburg, Fabian

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 23
    Constrained colourings of random graphs

    Constrained colourings of random graphs by Collares, Maurício, Kohayakawa, Yoshiharu, Moreira, Carlos Gustavo, Mota, Guilherme Oliveira

    Get full text
    Items that this one cites
    Conference Proceeding
    Save to List
    Saved in:
  4. 24
    Monochromatic trees in random graphs

    Monochromatic trees in random graphs by Kohayakawa, Yoshiharu, Guilherme Oliveira Mota, Schacht, Mathias

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 25
    Counting results for sparse pseudorandom hypergraphs I

    Counting results for sparse pseudorandom hypergraphs I by Kohayakawa, Yoshiharu, Mota, Guilherme Oliveira, Schacht, Mathias, Taraz, Anusch

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  6. 26
    On an anti‐Ramsey threshold for sparse graphs with one triangle

    On an anti‐Ramsey threshold for sparse graphs with one triangle by Kohayakawa, Y., Konstadinidis, P. B., Mota, G. O.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 27
    On the local density problem for graphs of given odd-girth

    On the local density problem for graphs of given odd-girth by Bedenknecht, Wiebke, Guilherme Oliveira Mota, Reiher, Christian, Schacht, Mathias

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 28
    The size-Ramsey number of powers of bounded degree trees

    The size-Ramsey number of powers of bounded degree trees by Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Guilherme Oliveira Mota, Parczyk, Olaf

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 29
    Loose Hamiltonian cycles forced by large \((k-2)\)-degree - sharp version

    Loose Hamiltonian cycles forced by large \((k-2)\)-degree - sharp version by Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Schacht, Mathias, Schnitzer, Jakob, Schulenburg, Fabian

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 30
    On the local density problem for graphs of given odd-girth

    On the local density problem for graphs of given odd-girth by Bedenknecht, Wiebke, Mota, Guilherme Oliveira, Reiher, Christian, Schacht, Mathias

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 31
    Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version

    Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version by Bastos, Josefran de Oliveira, Mota, Guilherme Oliveira, Schacht, Mathias, Schnitzer, Jakob, Schulenburg, Fabian

    Get full text
    Article
    Save to List
    Saved in:
  12. 32
    Loose Hamiltonian cycles forced by large \((k-2)\)-degree - approximate version

    Loose Hamiltonian cycles forced by large \((k-2)\)-degree - approximate version by Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Schacht, Mathias, Schnitzer, Jakob, Schulenburg, Fabian

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 33
    Separating path systems in complete graphs

    Separating path systems in complete graphs by Fernandes, Cristina G, Guilherme Oliveira Mota, Sanhueza-Matamala, Nicolás

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 34
    Three-colour bipartite Ramsey number for graphs with small bandwidth

    Three-colour bipartite Ramsey number for graphs with small bandwidth by Guilherme Oliveira Mota

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 35
    The anti-Ramsey threshold of complete graphs

    The anti-Ramsey threshold of complete graphs by Kohayakawa, Yoshiharu, Guilherme Oliveira Mota, Parczyk, Olaf, Schnitzer, Jakob

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 36
    Counting orientations of graphs with no strongly connected tournaments

    Counting orientations of graphs with no strongly connected tournaments by Botler, Fábio, Hoppen, Carlos, Guilherme Oliveira Mota

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 37
    Directed graphs with lower orientation Ramsey thresholds

    Directed graphs with lower orientation Ramsey thresholds by Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Kohayakawa, Yoshiharu, Guilherme Oliveira Mota, Naia, Tássio

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 38
    The threshold for the constrained Ramsey property

    The threshold for the constrained Ramsey property by Collares, Maurício, Kohayakawa, Yoshiharu, Moreira, Carlos Gustavo, Guilherme Oliveira Mota

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 39
    Counting graph orientations with no directed triangles

    Counting graph orientations with no directed triangles by Araújo, Pedro, Botler, Fábio, Guilherme Oliveira Mota

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 40
    Covering \(3\)-edge-coloured random graphs with monochromatic trees

    Covering \(3\)-edge-coloured random graphs with monochromatic trees by Kohayakawa, Yoshiharu, Mendonça, Walner, Guilherme Oliveira Mota, Schülke, Bjarne

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: