Advanced search
Start date
Betweenand

Ramsey theory, structural graph theory and applications in Bioinformatics

Abstract

This is the research project for the young investigators in emerging institutions grants to be developed in the Centro de Matemática, Computação e Cognição (CMCC) of Universidade Federal do ABC (UFABC) from 1/8/2018 to 31/7/2022 (48 months). The Computer Science is is present in many areas of knowledge, so the need to deal with increasingly complex problems requires the development of new technologies. This phenomenon has generated a demand for new techniques and advances in Computer Science. Important technological advances are not possible without consistent theoretical results that serve as basis for them. For example, fields such as Bioinformatics have benefited from the application of combinatorial techniques and the investigation of structural properties of graphs. This project has two main objectives: (i) to investigate structural and algorithmic characteristics of graphs and related structures; (ii) to apply graph theory in problems in the field of Bioinformatics via an interdisciplinary approach. Progress in the first of the objectives should provide new strategies for related problems as well as make available new techniques for problems in several areas of knowledge. A study of various combinatorial techniques and a good understanding of structural properties of graphs are the pillars of this project. The proposed team contains a mix of young academics with outstanding academic performance and renowned researchers who have extensive experience in the problems to be investigated. We hope this project will consolidate the research group in the area of combinatorics and graph theory at UFABC, as well as increase the synergy between the researchers participating in the project. In addition, the project will contribute to the strengthening of the national and international insertion of the university. The scientific contributions of the project will come with the publication of scientific articles in important journals of high circulation and with the presentation of papers in international conferences. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (18)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs. RANDOM STRUCTURES & ALGORITHMS, . (13/03447-6, 18/04876-1)
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, . (13/03447-6, 18/04876-1)
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, . (13/03447-6, 18/04876-1)
BASTOS, JOSEFRAN DE OLIVEIRA; BENEVIDES, FABRICIO SIQUEIRA; MOTA, GUILHERME OLIVEIRA; SAU, IGNASI. Counting Gallai 3-colorings of complete graphs. DISCRETE MATHEMATICS, v. 342, n. 9, p. 2618-2631, . (18/04876-1)
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, . (13/11431-2, 18/04876-1, 13/20733-2)
BARROS, GABRIEL FERREIRA; CAVALAR, BRUNO PASQUALOTTO; KOHAYAKAWA, YOSHIHARU; NAIA, TASSIO. ORIENTATION RAMSEY THRESHOLDS FOR CYCLES AND CLIQUES. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 35, n. 4, p. 2844-2857, . (19/13364-7, 18/05557-7, 18/04876-1)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. ear-perfect clique-factors in sparse pseudorandom graph. COMBINATORICS PROBABILITY & COMPUTING, v. 30, n. 4, p. 570-590, . (18/04876-1, 13/03447-6, 14/18641-5)
HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LANG, RICHARD; LEFMANN, HANNO; STAGNI, HENRIQUE. ON THE QUERY COMPLEXITY OF ESTIMATING THE DISTANCE TO HEREDITARY GRAPH PROPERTIES. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 35, n. 2, p. 1238-1251, . (17/02263-0, 15/15986-4, 18/04876-1)
BERGER, SOEREN; KOHAYAKAWA, YOSHIHARU; MAESAKA, GIULIA SATIKO; MARTINS, TAISA; MENDONCA, WALNER; MOTA, GUILHERME OLIVEIRA; PARCZYK, OLAF. The size-Ramsey number of powers of bounded degree trees. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, v. 103, n. 4, . (18/04876-1)
BEDENKNECHT, WIEBKE; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME O.. Powers of tight Hamilton cycles in randomly perturbed hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 55, n. 4, . (14/18641-5, 18/04876-1, 13/03447-6)
CLEMENS, DENNIS; JENSSEN, MATTHEW; KOHAYAKAWA, YOSHIHARU; MORRISON, NATASHA; MOTA, GUILHERME OLIVEIRA; REDING, DAMIAN; ROBERTS, BARNABY. The size-Ramsey number of powers of paths. JOURNAL OF GRAPH THEORY, v. 91, n. 3, p. 290-299, . (13/11431-2, 18/04876-1, 13/03447-6)
MOTA, G. O.. THREE-COLOR BIPARTITE RAMSEY NUMBER FOR GRAPHS WITH SMALL BANDWIDTH. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 33, n. 1, p. 197-208, . (18/04876-1)
COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs. RANDOM STRUCTURES & ALGORITHMS, v. 56, n. 4, p. 1016-1030, . (13/03447-6, 18/04876-1)
LINTZMAYER, C. N.; MOTA, G. O.; SAMBINELLI, M.. Decomposing split graphs into locally irregular graphs. DISCRETE APPLIED MATHEMATICS, v. 292, p. 33-44, . (17/23623-4, 18/04876-1, 13/03447-6)
KOHAYAKAWA, YOSHIHARU; MENDONCA, WALNER; MOTA, GUILHERME OLIVEIRA; SCHUELKE, BJARNE. COVERING 3-EDGE-COLORED RANDOM GRAPHS WITH MONOCHROMATIC TREES. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 35, n. 2, p. 1447-1459, . (18/04876-1, 19/13364-7)
KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; MOREIRA, CARLOS GUSTAVO; RODL, VOJTECH. On strong Sidon sets of integers. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 183, . (18/04876-1)
CHANG, YULIN; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; MOTA, GUILHERME OLIVEIRA. Factors in randomly perturbed hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 60, n. 2, . (19/13364-7, 18/04876-1)
KOHAYAKAWA, YOSHIHARU; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO. A tight lower bound for the online bounded space hypercube bin packing problem. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 23, n. 3, . (18/04876-1, 15/11937-9, 16/01860-1)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.