Busca avançada
Ano de início
Entree

Yoshiharu Kohayakawa

CV Lattes GoogleMyCitations ResearcherID ORCID


Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME)  (Instituição-sede da última proposta de pesquisa)
País de origem: Brasil

É Professor Titular da Universidade de São Paulo desde 2004. Obteve seu título de doutor em matemática na Universidade de Cambridge (1991), sob a orientação de Béla Bollobás. Seus interesses concentram-se nas áreas de combinatória e teoria da computação. Suas linhas de pesquisa envolvem, entre outros, grafos aleatórios, teoria de Ramsey, problemas extremais, métodos probabilísticos, e o método da regularidade. É membro dos corpos editoriais dos periódicos Combinatorics, Probability and Computing (Cambridge University Press), Random Structures and Algorithms (Wiley), Bulletin of the Brazilian Mathematical Society, New Series (Springer) e Matemática Contemporânea (SBM). De 2009 a 2017, foi Managing Editor do periódico Journal of Combinatorial Theory, Series B (Elsevier). De 2003 a 2008, foi membro do corpo editorial da SIAM Journal on Discrete Mathematics (SIAM). Ingressou na Academia Brasileira de Ciências em 1999, onde é Membro Titular desde 2001. Em 2019, tornou-se Fellow da TWAS, The World Academy of Sciences. (Fonte: Currículo Lattes)

Matéria(s) publicada(s) na Agência FAPESP sobre o(a) pesquisador(a)
Matéria(s) publicada(s) em Outras Mídias (0 total):
Mais itensMenos itens
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)
Auxílios à pesquisa
Bolsas no país
Bolsas no Exterior
Apoio FAPESP em números * Quantidades atualizadas em 11/09/2021
Colaboradores mais frequentes em auxílios e bolsas FAPESP
Contate o Pesquisador

Este canal da BV/FAPESP deve ser utilizado tão somente para mensagens, referentes aos projetos científicos financiados pela FAPESP.


 

 

 

 

Palavras-chave utilizadas pelo pesquisador
Publicações resultantes de Auxílios e Bolsas sob responsabilidade do(a) pesquisador(a) (116)

(Referências obtidas automaticamente do Web of Science e do SciELO, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores)

Publicações94
Citações323
Cit./Artigo3,4
Dados do Web of Science

COUTINHO, GABRIEL; GODSIL, CHRIS; GUO, KRYSTAL; ZHAN, HANMENG. A New Perspective on the Average Mixing Matrix. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 4, . Citações Web of Science: 1. (15/16339-2)

HAN, JIE; LO, ALLAN; SANHUEZA-MATAMALA, NICOLAS. Covering and tiling hypergraphs with tight cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 30, n. 2, p. 288-329, . Citações Web of Science: 0. (14/18641-5, 13/03447-6, 15/07869-8)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Matchings in k-partite k-uniform hypergraphs. JOURNAL OF GRAPH THEORY, v. 95, n. 1, . Citações Web of Science: 0. (15/07869-8, 13/03447-6, 14/18641-5)

BLINOVSKY, V. M.. Fractional matchings in hypergraphs. PROBLEMS OF INFORMATION TRANSMISSION, v. 51, n. 1, p. 25-30, . Citações Web of Science: 0. (12/13341-8, 13/07699-0)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for random graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 40, p. 26-41, . Citações Web of Science: 2. (09/06294-0, 13/07699-0, 13/03447-6, 12/00036-2)

AIGNER-HOREV, ELAD; HAN, HIEP; SCHACHT, MATHIAS. Extremal results for odd cycles in sparse pseudorandom graphs. COMBINATORICA, v. 34, n. 4, p. 379-406, . Citações Web of Science: 0. (10/16526-3)

LEMOS, MANOEL; MELO, T. R. B.. Connected hyperplanes in binary matroids. Linear Algebra and its Applications, v. 432, n. 1, p. 259-274, . Citações Web of Science: 2. (03/09925-5)

CORDOVIL, RAUL; MAIA, JR., BRAULIO; LEMOS, MANOEL. The 3-connected binary matroids with circumference 6 or 7. EUROPEAN JOURNAL OF COMBINATORICS, v. 30, n. 8, p. 1810-1824, . Citações Web of Science: 3. (03/09925-5)

ALLEN, P.; KOHAYAKAWA, Y.; MOTA, G. O.; PARENTE, R. F.. On the number of orientations of random graphs with no directed cycles of a given length. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, n. 1, . Citações Web of Science: 0. (13/07699-0, 10/09555-7, 12/00036-2, 13/03447-6, 13/20733-2, 09/06294-0)

BLINOVSKY, V. M.. Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect Fractional Matching and the MMS Conjecture. PROBLEMS OF INFORMATION TRANSMISSION, v. 50, n. 4, p. 340-349, . Citações Web of Science: 2. (12/13341-8, 13/07699-0)

COUTINHO, GABRIEL; GODSIL, CHRIS; GUO, KRYSTAL; ZHAN, HANMENG. A New Perspective on the Average Mixing Matrix. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 4, . Citações Web of Science: 1. (15/16339-2)

HAN, JIE; LO, ALLAN; TREGLOWN, ANDREW; ZHAO, YI. Exact Minimum Codegree Threshold for K-4(-)-Factors. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 6, p. 856-885, . Citações Web of Science: 2. (13/03447-6, 14/18641-5)

CHEN, GUANTAO; HAN, JIE; SUIL, O.; SHAN, SONGLING; TSUCHIYA, SHOICHI. Forbidden Pairs and the Existence of a Spanning Halin Subgraph. GRAPHS AND COMBINATORICS, v. 33, n. 5, p. 1321-1345, . Citações Web of Science: 1. (14/18641-5, 15/07869-8)

BLINOVSKY, V. M.. Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect Fractional Matching and the MMS Conjecture. PROBLEMS OF INFORMATION TRANSMISSION, v. 50, n. 4, p. 340-349, . Citações Web of Science: 2. (12/13341-8, 13/07699-0)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Matchings in k-partite k-uniform hypergraphs. JOURNAL OF GRAPH THEORY, v. 95, n. 1, . Citações Web of Science: 0. (14/18641-5, 13/03447-6, 15/07869-8)

COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs. RANDOM STRUCTURES & ALGORITHMS, . Citações Web of Science: 0. (13/03447-6, 18/04876-1)

BASTOS, JOSEFRAN DE OLIVEIRA; BENEVIDES, FABRICIO SIQUEIRA; HAN, JIE. The number of Gallai k-colorings of complete graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 144, p. 1-13, . Citações Web of Science: 0. (14/18641-5)

HAN, JIE. On vertex-disjoint paths in regular graphs. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

BERGER, S.; KOHAYAKAWA, Y.; MAESAKA, G. S.; MARTINS, T.; MENDONCA, W.; MOTA, G. O.; PARCZYK, O.. THE SIZE-RAMSEY NUMBER OF POWERS OF BOUNDED DEGREE TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 451-456, . Citações Web of Science: 0. (13/03447-6, 18/04876-1)

HAN, J.; KOHAYAKAWA, Y.; SALES, M. T.; STAGNI, H.. ON SOME EXTREMAL RESULTS FOR ORDER TYPES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 779-785, . Citações Web of Science: 0. (13/03447-6, 17/02263-0, 15/15986-4)

KOHAYAKAWA, Y.; MENDONCA, W.; MOTA, G.; SCHUELKE, B.. COVERING 3-COLOURED RANDOM GRAPHS WITH MONOCHROMATIC TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 871-875, . Citações Web of Science: 0. (13/03447-6, 18/04876-1)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly connected graphs into paths of length five. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 128-138, . Citações Web of Science: 1. (13/11431-2, 13/03447-6, 13/20733-2, 14/01460-8, 11/08033-0)

FRANKL, PETER; HAN, JIE; HUANG, HAO; ZHAO, YI. A degree version of the Hilton-Milner theorem. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 155, p. 493-502, . Citações Web of Science: 3. (13/03447-6, 14/18641-5)

COREGLIANO, LEONARDO N.; PARENTE, ROBERTO F.; SATO, CRISTIANE M.. On the maximum density of fixed strongly connected subtournaments. ELECTRONIC JOURNAL OF COMBINATORICS, v. 26, n. 1, . Citações Web of Science: 0. (13/23720-9)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS. Monochromatic trees in random graphs. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, v. 166, n. 1, p. 191-208, . Citações Web of Science: 2. (13/11431-2, 13/03447-6, 13/20733-2, 13/07699-0)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE - SHARP VERSION. CONTRIBUTIONS TO DISCRETE MATHEMATICS, v. 13, n. 2, p. 88-100, . Citações Web of Science: 0. (13/11431-2, 18/04876-1, 13/20733-2)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing regular graphs with prescribed girth into paths of given length. EUROPEAN JOURNAL OF COMBINATORICS, v. 66, p. 28-36, . Citações Web of Science: 0. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

ALLEN, PETER; BOTTCHER, JULIA; COOLEY, OLIVER; MYCROFT, RICHARD. Tight cycles and regular slices in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 30-100, . Citações Web of Science: 3. (09/17831-7, 10/09555-7)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 115-147, . Citações Web of Science: 4. (13/03447-6, 14/18641-5, 15/07869-8)

HAN, JIE. DECISION PROBLEM FOR PERFECT MATCHINGS IN DENSE k-UNIFORM HYPERGRAPHS. Transactions of the American Mathematical Society, v. 369, n. 7, p. 5197-5218, . Citações Web of Science: 6. (14/18641-5, 15/07869-8)

LEMOS, MANOEL; REID, TALMAGE JAMES; WU, HAIDONG. Characterizing 3-Connected Planar Graphs and Graphic Matroids. JOURNAL OF GRAPH THEORY, v. 64, n. 2, p. 165-174, . Citações Web of Science: 3. (03/09925-5)

KOHAYAKAWA‚ Y.; NAGLE‚ B.; RÖDL‚ V.. Hereditary properties of triple systems. COMBINATORICS PROBABILITY & COMPUTING, v. 12, n. 02, p. 155-189, . (96/04505-2)

HAXELL‚ P.; LUCZAK‚ T.; PENG‚ Y.; RÖDL‚ V.; RUCINSKI‚ A.; SKOKAN‚ J.. The Ramsey number for 3-uniform tight hypergraph cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 18, n. 1-2, p. 165-203, . (04/15397-4, 03/09925-5)

HAN, J.; KOHAYAKAWA, Y.; SALES, M. T.; STAGNI, H.. ON SOME EXTREMAL RESULTS FOR ORDER TYPES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 779-785, . Citações Web of Science: 0. (13/03447-6, 17/02263-0, 15/15986-4)

BASTOS, JOSEFRAN DE OLIVEIRA; BENEVIDES, FABRICIO SIQUEIRA; HAN, JIE. The number of Gallai k-colorings of complete graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 144, p. 1-13, . Citações Web of Science: 0. (14/18641-5)

GAO, WEI; HAN, JIE. Minimum Codegree Threshold for C-6(3)-Factors in 3-Uniform Hypergraphs. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 4, p. 536-559, . Citações Web of Science: 3. (14/18641-5, 13/03447-6, 15/07869-8)

AIGNER-HOREV, ELAD; HAN, HIEP. Polynomial configurations in subsets of random and pseudo-random sets. JOURNAL OF NUMBER THEORY, v. 165, p. 363-381, . Citações Web of Science: 0. (13/11353-1, 10/16526-3)

HAN, JIE. PERFECT MATCHINGS IN HYPERGRAPHS AND THE ERDOS MATCHING CONJECTURE. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1351-1357, . Citações Web of Science: 7. (14/18641-5, 15/07869-8)

DONADELLI, JAIR; KOHAYAKAWA, YOSHIHARU. A density result for random sparse oriented graphs and its relation to a conjecture of Woodall. ELECTRONIC JOURNAL OF COMBINATORICS, v. 9, . Citações Web of Science: 1. (96/04505-2)

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Sparse Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 215-236, . Citações Web of Science: 1. (10/09555-7, 13/07699-0, 13/03447-6, 09/17831-7)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly connected graphs into paths of length five. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 128-138, . Citações Web of Science: 1. (13/20733-2, 11/08033-0, 13/03447-6, 14/01460-8, 13/11431-2)

FRANKL, PETER; HAN, JIE; HUANG, HAO; ZHAO, YI. A degree version of the Hilton-Milner theorem. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 155, p. 493-502, . Citações Web of Science: 3. (14/18641-5, 13/03447-6)

HAN, JIE. On vertex-disjoint paths in regular graphs. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing regular graphs with prescribed girth into paths of given length. EUROPEAN JOURNAL OF COMBINATORICS, v. 66, p. 28-36, . Citações Web of Science: 0. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

ALLEN, PETER; BOTTCHER, JULIA; COOLEY, OLIVER; MYCROFT, RICHARD. Tight cycles and regular slices in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 30-100, . Citações Web of Science: 3. (10/09555-7, 09/17831-7)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 115-147, . Citações Web of Science: 4. (14/18641-5, 13/03447-6, 15/07869-8)

HAN, JIE. DECISION PROBLEM FOR PERFECT MATCHINGS IN DENSE k-UNIFORM HYPERGRAPHS. Transactions of the American Mathematical Society, v. 369, n. 7, p. 5197-5218, . Citações Web of Science: 6. (14/18641-5, 15/07869-8)

GAUY, MARCELO M.; HAN, HIEP; OLIVEIRA, IGOR C.. Erdos-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 3, p. 406-422, . Citações Web of Science: 0. (13/11353-1, 10/16526-3)

COREGLIANO, LEONARDO N.; PARENTE, ROBERTO F.; SATO, CRISTIANE M.. On the maximum density of fixed strongly connected subtournaments. ELECTRONIC JOURNAL OF COMBINATORICS, v. 26, n. 1, . Citações Web of Science: 0. (13/23720-9)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS. Monochromatic trees in random graphs. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, v. 166, n. 1, p. 191-208, . Citações Web of Science: 2. (13/20733-2, 13/03447-6, 13/07699-0, 13/11431-2)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE - SHARP VERSION. CONTRIBUTIONS TO DISCRETE MATHEMATICS, v. 13, n. 2, p. 88-100, . Citações Web of Science: 0. (13/11431-2, 18/04876-1, 13/20733-2)

HAN, JIE; ZHAO, YI. Forbidding Hamilton cycles in uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 143, p. 107-115, . Citações Web of Science: 0. (15/07869-8, 14/18641-5)

HAN, JIE; KOHAYAKAWA, YOSHIHARU. THE MAXIMUM SIZE OF A NON-TRIVIAL INTERSECTING UNIFORM FAMILY THAT IS NOT A SUBFAMILY OF THE HILTON-MILNER FAMILY. Proceedings of the American Mathematical Society, v. 145, n. 1, p. 73-87, . Citações Web of Science: 4. (14/18641-5, 13/07699-0, 13/03447-6, 15/07869-8)

HAN, JIE; LO, ALLAN; TREGLOWN, ANDREW; ZHAO, YI. Exact Minimum Codegree Threshold for K-4(-)-Factors. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 6, p. 856-885, . Citações Web of Science: 2. (14/18641-5, 13/03447-6)

CHEN, GUANTAO; HAN, JIE; SUIL, O.; SHAN, SONGLING; TSUCHIYA, SHOICHI. Forbidden Pairs and the Existence of a Spanning Halin Subgraph. GRAPHS AND COMBINATORICS, v. 33, n. 5, p. 1321-1345, . Citações Web of Science: 1. (14/18641-5, 15/07869-8)

KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; MOREIRA, CARLOS GUSTAVO; RODL, VOJTECH. On strong Sidon sets of integers. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 183, . Citações Web of Science: 0. (18/04876-1)

HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Finding any given 2-factor in sparse pseudorandom graphs efficiently. JOURNAL OF GRAPH THEORY, v. 96, n. 1, SI, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

HAN, JIE; ZHAO, YI. Hamiltonicity in randomly perturbed hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 144, p. 14-31, . Citações Web of Science: 0. (14/18641-5)

HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Clique-factors in sparse pseudorandom graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 82, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly edge-connected graphs into paths of any given length. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 122, p. 508-542, . Citações Web of Science: 7. (13/20733-2, 11/08033-0, 13/03447-6, 14/01460-8, 13/11431-2)

ALLEN, PETER; BOETTCHER, JULIA; HLADKY, JAN; PIGUET, DIANA. An extension of Turan's Theorem, uniqueness and stability. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, n. 4, . Citações Web of Science: 1. (09/17831-7, 10/09555-7)

ALLEN, PETER; KEEVASH, PETER; SUDAKOV, BENNY; VERSTRAETE, JACQUES. Turan numbers of bipartite graphs plus an odd cycle. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 106, p. 134-162, . Citações Web of Science: 9. (10/09555-7)

COUTINHO, GABRIEL; GODSIL, CHRIS; GUO, KRYSTAL; ZHAN, HANMENG. A New Perspective on the Average Mixing Matrix. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 4, . Citações Web of Science: 1. (15/16339-2)

HAN, JIE; LO, ALLAN; SANHUEZA-MATAMALA, NICOLAS. Covering and tiling hypergraphs with tight cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 30, n. 2, p. 288-329, . Citações Web of Science: 0. (14/18641-5, 13/03447-6, 15/07869-8)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Matchings in k-partite k-uniform hypergraphs. JOURNAL OF GRAPH THEORY, v. 95, n. 1, . Citações Web of Science: 0. (15/07869-8, 13/03447-6, 14/18641-5)

BLINOVSKY, V. M.. Fractional matchings in hypergraphs. PROBLEMS OF INFORMATION TRANSMISSION, v. 51, n. 1, p. 25-30, . Citações Web of Science: 0. (12/13341-8, 13/07699-0)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for random graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 40, p. 26-41, . Citações Web of Science: 2. (09/06294-0, 13/07699-0, 13/03447-6, 12/00036-2)

AIGNER-HOREV, ELAD; HAN, HIEP; SCHACHT, MATHIAS. Extremal results for odd cycles in sparse pseudorandom graphs. COMBINATORICA, v. 34, n. 4, p. 379-406, . Citações Web of Science: 0. (10/16526-3)

LEMOS, MANOEL; MELO, T. R. B.. Connected hyperplanes in binary matroids. Linear Algebra and its Applications, v. 432, n. 1, p. 259-274, . Citações Web of Science: 2. (03/09925-5)

CORDOVIL, RAUL; MAIA, JR., BRAULIO; LEMOS, MANOEL. The 3-connected binary matroids with circumference 6 or 7. EUROPEAN JOURNAL OF COMBINATORICS, v. 30, n. 8, p. 1810-1824, . Citações Web of Science: 3. (03/09925-5)

HAN, JIE; KIM, JAEHOON. Two-regular subgraphs of odd-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 128, p. 175-191, . Citações Web of Science: 0. (13/03447-6, 14/18641-5, 15/07869-8)

CARMO, RENATO; FEDER, TOMAS; KOHAYAKAWA, YOSHIHARU; LABER, EDUARDO; MOTWANI, RAJEEV; O'CALLAGHAN, LIADAN; PANIGRAHY, RINA; THOMAS, DILYS. Querying Priced Information in Databases: The Conjunctive Case. ACM TRANSACTIONS ON ALGORITHMS, v. 3, n. 1, SI, . Citações Web of Science: 0. (03/09925-5)

BEDENKNECHT, WIEBKE; MOTA, GUILHERME OLIVEIRA; REIHER, CHRISTIAN; SCHACHT, MATHIAS. On the local density problem for graphs of given odd-girth. JOURNAL OF GRAPH THEORY, v. 90, n. 2, p. 137-149, . Citações Web of Science: 0. (13/03447-6, 13/11431-2, 13/20733-2)

HAN, JIE. ON PERFECT MATCHINGS AND TILINGS IN UNIFORM HYPERGRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 32, n. 2, p. 919-932, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

ALLEN, PETER; BOETTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. Tight Hamilton Cycles in Random Hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 46, n. 3, p. 446-465, . Citações Web of Science: 7. (10/09555-7, 13/07699-0, 13/03447-6, 09/17831-7)

ALLEN, PETER; KEEVASH, PETER; SUDAKOV, BENNY; VERSTRAETE, JACQUES. Turan numbers of bipartite graphs plus an odd cycle. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 106, p. 134-162, . Citações Web of Science: 9. (10/09555-7)

HAN, JIE; KOHAYAKAWA, YOSHIHARU. On hypergraphs without loose cycles. DISCRETE MATHEMATICS, v. 341, n. 4, p. 946-949, . Citações Web of Science: 2. (14/18641-5, 13/07699-0, 13/03447-6)

HAN, JIE. NEAR PERFECT MATCHINGS IN k-UNIFORM HYPERGRAPHS II. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1453-1469, . Citações Web of Science: 1. (14/18641-5, 15/07869-8)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 276-287, . Citações Web of Science: 1. (09/06294-0, 13/20733-2, 13/07699-0, 13/03447-6, 13/11431-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 288-301, . Citações Web of Science: 1. (13/20733-2, 13/03447-6, 13/07699-0, 13/11431-2)

BASTOS, JOSEFRAN DE OLIVEIRA; COREGLIANO, LEONARDO NAGAMI. Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 18, n. 2, . Citações Web of Science: 0. (13/23720-9)

HAN, JIE. NEAR PERFECT MATCHINGS IN k-UNIFORM HYPERGRAPHS II. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1453-1469, . Citações Web of Science: 1. (14/18641-5, 15/07869-8)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 276-287, . Citações Web of Science: 1. (13/11431-2, 13/03447-6, 13/20733-2, 09/06294-0, 13/07699-0)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 288-301, . Citações Web of Science: 1. (13/11431-2, 13/03447-6, 13/20733-2, 13/07699-0)

BLINOVSKY, VLADIMIR; GREENHILL, CATHERINE. Asymptotic enumeration of sparse uniform hypergraphs with given degrees. EUROPEAN JOURNAL OF COMBINATORICS, v. 51, p. 287-296, . Citações Web of Science: 3. (12/13341-8, 13/07699-0)

FERNANDES, CRISTINA G.; STEIN, MAYA. Geodesic stability for memoryless binary long-lived consensus. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v. 81, n. 7, p. 1210-1220, . Citações Web of Science: 0. (05/54051-9)

BOTLER, F.; MOTA, G. O.; WAKABAYASHI, Y.. Decompositions of triangle-free 5-regular graphs into paths of length five. DISCRETE MATHEMATICS, v. 338, n. 11, p. 1845-1855, . Citações Web of Science: 4. (13/11431-2, 13/20733-2, 11/08033-0, 14/01460-8)

ALLEN, PETER; BOETTCHER, JULIA; HLADKY, JAN; PIGUET, DIANA. A Density Corradi-Hajnal Theorem. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, v. 67, n. 4, p. 721-758, . Citações Web of Science: 4. (09/17831-7, 10/09555-7)

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Dense Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 185-214, . Citações Web of Science: 0. (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0)

HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Finding any given 2-factor in sparse pseudorandom graphs efficiently. JOURNAL OF GRAPH THEORY, v. 96, n. 1, SI, . Citações Web of Science: 0. (13/03447-6, 14/18641-5)

BENEVIDES, FABRICIO SIQUEIRA; SKOKAN, JOZEF. The 3-colored Ramsey number of even cycles. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 99, n. 4, p. 690-708, . Citações Web of Science: 19. (03/09925-5, 04/15397-4, 05/52494-0)

PIGUET, DIANA; JAKOBINE STEIN, MAYA. An approximate version of the Loebl-Komlos-Sos conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 102, n. 1, p. 102-125, . Citações Web of Science: 9. (05/54051-9)

KOHAYAKAWA‚ Y.; KREUTER‚ B.; STEGER‚ A.. An extremal problem for random graphs and the number of graphs with large even-girth. COMBINATORICA, v. 18, n. 1, p. 101-120, . (96/04505-2)

SOARES‚ J.; STEFANES‚ M.A.. Algorithms for maximum independent set in convex bipartite graphs. ALGORITHMICA, v. 53, n. 1, p. 35-49, . (96/04505-2, 98/06327-0)

LEE‚ O.; WAKABAYASHI‚ Y.. On the circuit cover problem for mixed graphs. COMBINATORICS PROBABILITY & COMPUTING, v. 11, n. 01, p. 43-59, . (96/04505-2)

KOHAYAKAWA‚ Y.; PRÖMEL‚ H.J.; RÖDL‚ V.. Induced ramsey numbers. COMBINATORICA, v. 18, n. 3, p. 373-404, . (96/04505-2)

KOHAYAKAWA, YOSHIHARU; NAGLE, BRENDAN; RODL, VOJTECH; SCHACHT, MATHIAS. Weak hypergraph regularity and linear hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 100, n. 2, p. 151-160, . Citações Web of Science: 23. (03/09925-5)

CORDOVIL, RAUL; LEMOS, MANOEL. The 3-connected matroids with circumference 6. DISCRETE MATHEMATICS, v. 310, n. 8, p. 1354-1365, . Citações Web of Science: 0. (03/09925-5)

ALLEN, PETER; BOETTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. The chromatic thresholds of graphs. ADVANCES IN MATHEMATICS, v. 235, p. 261-295, . Citações Web of Science: 12. (10/09555-7, 09/17831-7)

FERNANDES, CRISTINA G.; LEE, ORLANDO; WAKABAYASHI, YOSHIKO. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. DISCRETE APPLIED MATHEMATICS, v. 157, n. 2, p. 272-279, . Citações Web of Science: 7. (03/09925-5)

BOETTCHER, JULIA; FONIOK, JAN. Ramsey Properties of Permutations. ELECTRONIC JOURNAL OF COMBINATORICS, v. 20, n. 1, . Citações Web of Science: 6. (09/17831-7)

MARTINEZ‚ F.V.; DE PINA‚ J.C.; SOARES‚ J.. Algorithms for terminal Steiner trees. THEORETICAL COMPUTER SCIENCE, v. 389, n. 1, p. 133-142, . (04/14335-5, 03/09925-5)

KAWARABAYASHI, KEN-ICHI; LEE, ORLANDO; REED, BRUCE; WOLLAN, PAUL. A weaker version of Lovasz' path removal conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 98, n. 5, p. 972-979, . Citações Web of Science: 7. (03/09925-5)

DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH; RUCINSKI, ANDRZEJ. UNIVERSALITY OF RANDOM GRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 26, n. 1, p. 353-374, . Citações Web of Science: 7. (03/09925-5)

BUSS, ENNO; HAN, HIEP; SCHACHT, MATHIAS. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 103, n. 6, p. 658-678, . Citações Web of Science: 13. (10/16526-3)

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LEFMANN, HANNO. Hypergraphs with many Kneser colorings. EUROPEAN JOURNAL OF COMBINATORICS, v. 33, n. 5, SI, p. 816-843, . Citações Web of Science: 8. (07/56496-3)

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; MOREIRA, CARLOS GUSTAVO; SAMPAIO, RUDINI MENEZES. Testing permutation properties through subpermutations. THEORETICAL COMPUTER SCIENCE, v. 412, n. 29, p. 3555-3567, . Citações Web of Science: 12. (07/56496-3)

BRUHN, HENNING; STEIN, MAYA. Duality of Ends. COMBINATORICS PROBABILITY & COMPUTING, v. 19, n. 1, p. 47-60, . Citações Web of Science: 7. (05/54051-9)

XAVIER‚ E.C.; MIYAZAWA‚ F.K.. The class constrained bin packing problem with applications to video-on-demand. THEORETICAL COMPUTER SCIENCE, v. 393, n. 1, p. 240-259, . (03/09925-5)

KIM‚ S.J.; NAKPRASIT‚ K.; PELSMAJER‚ M.J.; SKOKAN‚ J.. Transversal numbers of translates of a convex body. DISCRETE MATHEMATICS, v. 306, n. 18, p. 2166-2173, . (03/09925-5, 04/15397-4)

LEMOS‚ M.; MELO‚ TRB. Non-separating cocircuits in matroids. DISCRETE APPLIED MATHEMATICS, v. 156, n. 7, p. 1019-1024, . (03/09925-5)

MIYAZAWA‚ FK; WAKABAYASHI‚ Y.. Two-and three-dimensional parametric packing. Computers & Operations Research, v. 34, n. 9, p. 2589-2603, . (03/09925-5)

XAVIER‚ EC; MIYAZAWA‚ FK. Approximation schemes for knapsack problems with shelf divisions. THEORETICAL COMPUTER SCIENCE, v. 352, n. 1, p. 71-84, . (03/09925-5)

XAVIER‚ EC; MIYAZAWA‚ F.K.. A one-dimensional bin packing problem with shelf divisions. DISCRETE APPLIED MATHEMATICS, v. 156, n. 7, p. 1083-1096, . (03/09925-5)

MARCINISZYN‚ M.; SKOKAN‚ J.; SPÖHEL‚ R.; STEGER‚ A.. Asymmetric Ramsey properties of random graphs involving cliques. RANDOM STRUCTURES & ALGORITHMS, v. 34, n. 4, p. 419-453, . (03/09925-5, 04/15397-4)

HAN, JIE; TREGLOWN, ANDREW. The complexity of perfect matchings and packings in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 141, p. 72-104, . Citações Web of Science: 0. (13/03447-6, 15/07869-8, 14/18641-5)

Publicações acadêmicas

(Referências obtidas automaticamente das Instituições de Ensino e Pesquisa do Estado de São Paulo)

JUNIOR, Domingos Dellamonica. Extração de aleatoriedade a partir de fontes defeituosas. Dissertação (Mestrado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (04/11501-1

MOTA, Guilherme Oliveira. Dois resultados em combinatória contemporânea. Tese (Doutorado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (09/06294-0

BENEVIDES, Fabricio Siqueira. Teoria de Ramsey para circuitos e caminhos. Dissertação (Mestrado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (05/52494-0

SATO, Cristiane Maria. Homomorfismos de grafos. Dissertação (Mestrado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (06/58578-4

COREGLIANO, Leonardo Nagami. Álgebras de flags e torneios. Dissertação (Mestrado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (13/23720-9

STAGNI, Henrique. Teste de propriedades e estimação de parâmetros. Tese (Doutorado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (15/15986-4

Por favor, reporte erros na informação da página do pesquisador escrevendo para: cdi@fapesp.br.
X

Reporte um problema na página


Detalhes do problema: