Risultati finali Open Research Data Pilot (1) Data Management Plan Participation in the Open Research Data Pilot Pubblicazioni Peer reviewed articles (10) Ramsey numbers with prescribed rate of growth Autori: Matías Pavez-Signé, Simón Piga, Nicolás Sanhueza-Matamala Pubblicato in: Electronic Journal of Combinatorics, 2023, ISSN 1077-8926 Editore: Electronic Journal of Combinatorics Towards a hypergraph version of the Pósa-Seymour conjecture Autori: Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein Pubblicato in: Advances in Combinatorics, 2023, ISSN 2517-5599 Editore: Alliance of Diamond Open Access Journals C4-free subgraphs with large average degree Autori: Richard Montgomery Alexey Pokrovskiy Benny Sudakov Pubblicato in: Israel Journal of Mathematics, Issue 246, 2021, Page(s) 55-71, ISSN 0021-2172 Editore: Magnes Press DOI: 10.1007/s11856-021-2236-8 Spanning trees in dense directed graphs Autori: Kathapurkar, Amarja; Montgomery, Richard Pubblicato in: Journal of Combinatorial Theory, Series B, Issue 156, 2022, Page(s) 223-249, ISSN 0095-8956 Editore: Academic Press DOI: 10.1016/j.jctb.2022.04.007 A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs, Autori: Candida Bowtell, Joseph Hyde Pubblicato in: SIAM Journal on Discrete Mathematics, 2022, ISSN 0895-4801 Editore: Society for Industrial and Applied Mathematics Trees with few leaves in tournaments Autori: Alistair Benford; Richard Montgomery Pubblicato in: Journal of Combinatorial Theory, Series B, Issue 155, 2022, Page(s) 141-170, ISSN 0095-8956 Editore: Academic Press DOI: 10.1016/j.jctb.2022.02.005 A proof of Ringel's conjecture Autori: Richard Montgomery Alexey Pokrovskiy Benny Sudakov Pubblicato in: Geometric and Functional Analysis, Issue 31, 2021, Page(s) 663–720, ISSN 1016-443X Editore: Birkhauser Verlag DOI: 10.1007/s00039-021-00576-2 A solution to Erdős and Hajnal’s odd cycle problem Autori: Hong Liu, Richard Montgomery Pubblicato in: Journal of the American Mathematical Society, 2023, ISSN 0894-0347 Editore: American Mathematical Society DOI: 10.1090/jams/1018 Transversal factors and spanning trees Autori: Montgomery, Richard; Müyesser, Alp; Pehova, Yanitsa Pubblicato in: Advances in Combinatorics, Issue 3, 2022, ISSN 2517-5599 Editore: Alliance of Diamond Open Access Journals DOI: 10.19086/aic.2022.3 Spanning surfaces in 3-graphs Autori: Agelos Georgakopoulos John Haslegrave Richard Montgomery Bhargav Narayanan Pubblicato in: Journal of the European Mathematical Society, Issue 24(1), 2021, Page(s) 303-229, ISSN 1435-9855 Editore: European Mathematical Society Publishing House DOI: 10.4171/jems/1101 Other (7) Counting spanning subgraphs in dense hypergraphs Autori: Richard Montgomery, Matías Pavez-Signé Pubblicato in: arXiv preprint, 2023 Editore: arXiv Spanning subdivisions in Dirac graphs Autori: Matías Pavez-Signé Pubblicato in: arXiv preprint, 2023 Editore: arXiv Spanning trees in the square of pseudorandom graphs Autori: Matías Pavez-Signé Pubblicato in: arXiv preprint, 2023 Editore: arXiv Ramsey numbers of cycles in random graphs Autori: Pedro Araújo, Matías Pavez-Signé, Nicolás Sanhueza-Matamala Pubblicato in: arXiv preprint, 2022 Editore: arXiv Trees with many leaves in tournaments Autori: Alistair Benford, Richard Montgomery Pubblicato in: arXiv preprint, 2022 Editore: arXiv Spanning cycles in random directed graphs Autori: Richard Montgomery Pubblicato in: arXiv preprint, 2021 Editore: arXiv Proof of the Kohayakawa--Kreuter conjecture for the majority of cases Autori: Candida Bowtell, Robert Hancock, Joseph Hyde Pubblicato in: arXiv preprint, 2023 Editore: arXiv Conference proceedings (1) Towards the Erdős-Gallai Cycle Decomposition Conjecture Autori: Matija Bucić, Richard Montgomery Pubblicato in: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, ISBN 978-1-4503-9913-5 Editore: Association for Computing Machinery DOI: 10.1145/3564246.3585218 È in corso la ricerca di dati su OpenAIRE... Si è verificato un errore durante la ricerca dei dati su OpenAIRE Nessun risultato disponibile
