Skip to main content
European Commission logo print header

Quasi-random hypergraphs

Publicaciones

Sharp bounds for decomposing graphs into edges and triangles

Autores: Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Publicado en: Combinatorics, Probability and Computing, Issue 30/2, 2021, Page(s) 271-287, ISSN 0963-5483
Editor: Cambridge University Press
DOI: 10.1017/s0963548320000358

On tripartite common graphs

Autores: Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
Publicado en: Combinatorics, Probability and Computing, Issue 09635483, 2022, Page(s) 907-923, ISSN 0963-5483
Editor: Cambridge University Press
DOI: 10.1017/s0963548322000074

Compactness and finite forcibility of graphons

Autores: Roman Glebov, Daniel Král', Jan Volec
Publicado en: Journal of the European Mathematical Society, Issue 21/10, 2019, Page(s) 3199-3223, ISSN 1435-9855
Editor: European Mathematical Society Publishing House
DOI: 10.4171/jems/901

Counterexamples to a Conjecture of Harris on Hall Ratio

Autores: Adam Blumenthal; Bernard Lidický; Ryan R. Martin; Sergey Norin; Florian Pfender; Jan Volec
Publicado en: SIAM Journal on Discrete Mathematics, Issue 08954801, 2022, ISSN 0895-4801
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1229420

Limits of Order Types

Autores: Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec
Publicado en: 2018
Editor: arxiv
DOI: 10.48550/arxiv.1811.02236

Buscando datos de OpenAIRE...

Se ha producido un error en la búsqueda de datos de OpenAIRE

No hay resultados disponibles