Articoli con mandati relativi all'accesso pubblico - Jacques VerstraeteUlteriori informazioni
Non disponibile pubblicamente: 1
Extremal problems for cycles in graphs
J Verstraëte
Recent trends in combinatorics, 83-116, 2016
Mandati: US National Science Foundation
Disponibili pubblicamente: 37
A survey of Turán problems for expansions
D Mubayi, J Verstraëte
Recent trends in combinatorics, 117-143, 2016
Mandati: US National Science Foundation
The asymptotics of r (4, t)
S Mattheus, J Verstraete
Annals of Mathematics 199 (2), 919-941, 2024
Mandati: US National Science Foundation
Stability in the Erdős–Gallai theorems on cycles and paths
Z Füredi, A Kostochka, J Verstraëte
Journal of Combinatorial Theory, Series B 121, 197-228, 2016
Mandati: US National Science Foundation, Hungarian Scientific Research Fund, European …
Turán numbers of bipartite graphs plus an odd cycle
P Allen, P Keevash, B Sudakov, J Verstraëte
Journal of Combinatorial Theory, Series B 106, 134-162, 2014
Mandati: UK Engineering and Physical Sciences Research Council, European Commission
Turán problems and shadows II: trees
A Kostochka, D Mubayi, J Verstraëte
Journal of Combinatorial Theory, Series B 122, 457-478, 2017
Mandati: US National Science Foundation
On a conjecture of Erdős and Simonovits: Even cycles
P Keevash, B Sudakov, J Verstraëte
Combinatorica 33, 699-732, 2013
Mandati: UK Engineering and Physical Sciences Research Council, European Commission
Stability in the Erdős–Gallai theorem on cycles and paths, II
Z Füredi, A Kostochka, R Luo, J Verstraëte
Discrete Mathematics 341 (5), 1253-1263, 2018
Mandati: US National Science Foundation, European Commission, National Office for …
Cycles in triangle-free graphs of large chromatic number
A Kostochka, B Sudakov, J Verstraëte
Combinatorica 37, 481-494, 2017
Mandati: US National Science Foundation, Swiss National Science Foundation
Graphs without theta subgraphs
J Verstraëte, J Williford
Journal of Combinatorial Theory, Series B 134, 76-87, 2019
Mandati: US National Science Foundation
A note on pseudorandom Ramsey graphs
D Mubayi, J Verstraëte
J. Eur. Math. Soc.(JEMS) 26 (1), 153-161, 2024
Mandati: US National Science Foundation
Hypergraphs not containing a tight tree with a bounded trunk
Z Füredi, T Jiang, A Kostochka, D Mubayi, J Verstraëte
SIAM Journal on Discrete Mathematics 33 (2), 862-873, 2019
Mandati: US National Science Foundation, National Office for Research, Development …
Non-trivial d-wise intersecting families
J O'Neill, J Verstraëte
Journal of Combinatorial Theory, Series A 178, 105369, 2021
Mandati: US National Science Foundation
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Z Füredi, T Jiang, A Kostochka, D Mubayi, J Verstraëte
Canadian Journal of Mathematics 73 (6), 1648-1666, 2021
Mandati: US National Science Foundation, National Office for Research, Development …
Counting hypergraphs with large girth
S Spiro, J Verstraëte
Journal of Graph Theory 100 (3), 543-558, 2022
Mandati: US National Science Foundation
Triangle-free subgraphs of hypergraphs
J Nie, S Spiro, J Verstraëte
Graphs and Combinatorics 37, 2555-2570, 2021
Mandati: US National Science Foundation
Ordered and convex geometric trees with linear extremal function
Z Füredi, A Kostochka, D Mubayi, J Verstraëte
Discrete & Computational Geometry 64 (2), 324-338, 2020
Mandati: US National Science Foundation, National Office for Research, Development …
On even-degree subgraphs of linear hypergraphs
D Dellamonica Jr, P Haxell, T Łuczak, D Mubayi, B Nagle, Y Person, ...
Combinatorics, Probability and Computing 21 (1-2), 113-127, 2012
Mandati: German Research Foundation
A Note on k-Wise Oddtown Problems
J O’Neill, J Verstraëte
Graphs and Combinatorics 38 (3), 101, 2022
Mandati: US National Science Foundation
Relative Turán problems for uniform hypergraphs
S Spiro, J Verstraëte
SIAM Journal on Discrete Mathematics 35 (3), 2170-2191, 2021
Mandati: US National Science Foundation
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software