| Publication | Date of Publication | Type |
|---|
| How connectivity affects the extremal number of trees | 2024-05-10 | Paper |
| Stability of extremal connected hypergraphs avoiding Berge-paths | 2024-03-26 | Paper |
| Extremal results for graphs avoiding a rainbow subgraph | 2024-02-19 | Paper |
| On \(3\)-uniform hypergraphs avoiding a cycle of length four | 2024-02-16 | Paper |
| On graphs without cycles of length 0 modulo 4 | 2023-12-15 | Paper |
| A note on universal graphs for spanning trees | 2023-11-02 | Paper |
| Generalized Turán numbers for the edge blow-up of a graph | 2023-10-30 | Paper |
| Edges Not Covered by Monochromatic Bipartite Graph | 2023-10-26 | Paper |
| The maximum number of paths of length three in a planar graph | 2023-10-05 | Paper |
| The maximum number of induced C5's in a planar graph | 2023-10-05 | Paper |
| Stability version of Dirac's theorem and its applications for generalized Turán problems | 2023-09-15 | Paper |
| On the Small Quasi-kernel conjecture | 2023-07-09 | Paper |
| Subgraph densities in \(K_r\)-free graphs | 2023-04-19 | Paper |
| Turán problems for \(k\)-geodetic digraphs | 2023-03-09 | Paper |
| Turán numbers of Berge trees | 2023-02-21 | Paper |
| The maximum Wiener index of a uniform hypergraph | 2023-02-16 | Paper |
| The maximum number of cliques in graphs with bounded odd circumference | 2022-12-04 | Paper |
| Linear three-uniform hypergraphs with no Berge path of given length | 2022-11-29 | Paper |
| Set systems without a simplex, Helly hypergraphs and union-efficient families | 2022-10-28 | Paper |
| Exact results for generalized extremal problems forbidding an even cycle | 2022-08-04 | Paper |
| The maximum number of copies of an even cycle in a planar graph | 2022-05-31 | Paper |
| Subgraph densities in $K_r$-free graphs | 2022-05-26 | Paper |
| Inverse Turán numbers | 2022-03-14 | Paper |
| Generalized planar Turán numbers | 2021-11-22 | Paper |
| Connected hypergraphs without long Berge-paths | 2021-06-18 | Paper |
| Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 | 2021-06-15 | Paper |
| The maximum Wiener index of maximal planar graphs | 2021-05-10 | Paper |
| The maximum number of paths of length four in a planar graph | 2021-03-25 | Paper |
| The structure of hypergraphs without long Berge cycles | 2021-03-08 | Paper |
| Turan problems for $k$-geodetic digraphs | 2021-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146295 | 2021-01-25 | Paper |
| Ramsey numbers of Berge-hypergraphs and related structures | 2019-12-09 | Paper |
| Independent Chains in Acyclic Posets | 2019-12-06 | Paper |
| The Maximum Number of Pentagons in a Planar Graph | 2019-09-30 | Paper |
| The maximum number of $P_\ell$ copies in $P_k$-free graphs | 2019-08-01 | Paper |
| An Erdős-Gallai type theorem for vertex colored graphs | 2019-06-28 | Paper |
| Tur\'an numbers of Berge trees | 2019-04-14 | Paper |
| A note on the maximum number of triangles in a C5‐free graph | 2019-03-28 | Paper |
| On the maximum size of connected hypergraphs without a path of given length | 2018-07-26 | Paper |
| A note on the maximum number of triangles in a \(C_5\)-free graph | 2018-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178420 | 2015-03-16 | Paper |
| Numerical comparison of different algorithms for construction of wavelet matrices | 2012-11-19 | Paper |
| P\'osa-type results for Berge-hypergraphs | 0001-01-03 | Paper |
