J. Verstraëte

From MaRDI portal
(Redirected from Person:311563)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Ramsey numbers and the Zarankiewicz problem
Bulletin of the London Mathematical Society
2024-10-08Paper
The asymptotics of \(r(4,t)\)
Annals of Mathematics. Second Series
2024-03-13Paper
A note on pseudorandom Ramsey graphs
Journal of the European Mathematical Society (JEMS)
2024-03-11Paper
Coloring unions of nearly disjoint hypergraph cliques
Mathematika
2024-01-29Paper
Extremal Problems for Hypergraph Blowups of Trees
SIAM Journal on Discrete Mathematics
2023-10-26Paper
Hypergraph Ramsey numbers of cliques versus stars
Random Structures & Algorithms
2023-10-17Paper
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
Random Structures & Algorithms
2023-10-12Paper
Counting hypergraphs with large girth
Journal of Graph Theory
2023-10-05Paper
Ramsey numbers and the Zarankiewicz problem2023-07-17Paper
Large $(k; r, s; n, q)$-sets in Projective Spaces2022-11-08Paper
On asymptotic packing of geometric graphs
Discrete Applied Mathematics
2022-10-13Paper
Set-coloring Ramsey numbers via codes2022-06-22Paper
A note on \(k\)-wise oddtown problems
Graphs and Combinatorics
2022-05-31Paper
Extremal problems for pairs of triangles
Journal of Combinatorial Theory. Series B
2022-04-27Paper
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Canadian Journal of Mathematics
2022-01-12Paper
Ramsey numbers for nontrivial Berge cycles
SIAM Journal on Discrete Mathematics
2022-01-07Paper
Triangle-free subgraphs of hypergraphs
Graphs and Combinatorics
2021-11-30Paper
Relative Turán problems for uniform hypergraphs
SIAM Journal on Discrete Mathematics
2021-10-18Paper
Relative Turán numbers for hypergraph cycles
Discrete Mathematics
2021-08-02Paper
A generalization of the Bollobás set pairs inequality
The Electronic Journal of Combinatorics
2021-07-06Paper
Independent dominating sets in graphs of girth five
Combinatorics, Probability and Computing
2021-06-15Paper
Non-trivial \(d\)-wise intersecting families
Journal of Combinatorial Theory. Series A
2021-02-02Paper
Tight paths in convex geometric hypergraphs
Advances in Combinatorics
2020-10-20Paper
Partitioning ordered hypergraphs
Journal of Combinatorial Theory. Series A
2020-10-07Paper
Ordered and convex geometric trees with linear extremal function
Discrete & Computational Geometry
2020-09-01Paper
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
Discrete Applied Mathematics
2020-04-01Paper
Constructions of point-line arrangements in the plane with large girth2019-11-26Paper
Hypergraphs not containing a tight tree with a bounded trunk
SIAM Journal on Discrete Mathematics
2019-08-29Paper
Graphs without theta subgraphs
Journal of Combinatorial Theory. Series B
2018-12-20Paper
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms
2018-11-05Paper
Full subgraphs
Journal of Graph Theory
2018-08-16Paper
Extremal problems on ordered and convex geometric hypergraphs2018-07-13Paper
Cycles in triangle-free graphs of large chromatic number
Combinatorica
2018-04-12Paper
Stability in the Erdős-Gallai theorem on cycles and paths. II
Discrete Mathematics
2018-04-05Paper
Probabilistic constructions in generalized quadrangles
Discrete Mathematics
2017-09-28Paper
Tight paths in convex geometric hypergraphs2017-09-04Paper
The extremal function for cycles of length \(\ell\) mod \(k\)
The Electronic Journal of Combinatorics
2017-02-17Paper
The extremal function for cycles of length \(\ell\) mod \(k\)
The Electronic Journal of Combinatorics
2017-02-17Paper
Extremal problems for cycles in graphs
Recent Trends in Combinatorics
2017-01-25Paper
A survey of Turán problems for expansions
Recent Trends in Combinatorics
2017-01-25Paper
Turán problems and shadows. II: Trees
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Stability in the Erdős-Gallai theorems on cycles and paths
Journal of Combinatorial Theory. Series B
2016-10-12Paper
Counting trees in graphs
The Electronic Journal of Combinatorics
2016-09-13Paper
The number of trees in a graph2015-11-23Paper
On sets of integers with restrictions on their products
European Journal of Combinatorics
2015-09-30Paper
On coupon colorings of graphs
Discrete Applied Mathematics
2015-07-24Paper
Hypergraph Ramsey numbers: triangles versus cliques
Journal of Combinatorial Theory. Series A
2015-06-19Paper
Turán Problems and Shadows III: Expansions of Graphs
SIAM Journal on Discrete Mathematics
2015-06-08Paper
Turán problems and shadows. I: Paths and cycles
Journal of Combinatorial Theory. Series A
2014-11-19Paper
A counterexample to sparse removal
European Journal of Combinatorics
2014-11-19Paper
Turán numbers of bipartite graphs plus an odd cycle
Journal of Combinatorial Theory. Series B
2014-08-28Paper
On independent sets in hypergraphs
Random Structures & Algorithms
2014-04-15Paper
On a conjecture of Erdős and Simonovits: even cycles
Combinatorica
2014-03-17Paper
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes2013-11-19Paper
Large incidence-free sets in geometries
The Electronic Journal of Combinatorics
2013-06-07Paper
On the independence number of Steiner systems
Combinatorics, Probability and Computing
2013-03-14Paper
The de Bruijn-Erdős theorem for hypergraphs
Designs, Codes and Cryptography
2012-11-28Paper
On even-degree subgraphs of linear hypergraphs
Combinatorics, Probability and Computing
2012-05-14Paper
On the threshold for \(k\)-regular subgraphs of random graphs
Combinatorica
2012-04-26Paper
Cycles in graphs with large independence ratio
Journal of Combinatorics
2011-08-23Paper
On dissemination thresholds in regular and irregular graph classes
Algorithmica
2011-03-02Paper
Cycles in Sparse Graphs II2010-10-25Paper
List coloring hypergraphs
The Electronic Journal of Combinatorics
2010-10-13Paper
The de Bruijn-Erdos Theorem for hypergraphs2010-06-03Paper
On decompositions of complete hypergraphs
Journal of Combinatorial Theory. Series A
2009-11-26Paper
Two-regular subgraphs of hypergraphs
Journal of Combinatorial Theory. Series B
2009-06-23Paper
The maximum size of hypergraphs without generalized 4-cycles
Journal of Combinatorial Theory. Series A
2009-06-17Paper
An extremal characterization of projective planes
The Electronic Journal of Combinatorics
2009-04-07Paper
An extremal characterization of projective planes
The Electronic Journal of Combinatorics
2009-04-07Paper
A note on polynomials and \(f\)-factors of graphs
The Electronic Journal of Combinatorics
2009-04-07Paper
A note on polynomials and \(f\)-factors of graphs
The Electronic Journal of Combinatorics
2009-04-07Paper
Clique partitions of complements of forests and bounded degree graphs
Discrete Mathematics
2008-11-12Paper
Cycle lengths in sparse graphs
Combinatorica
2008-10-21Paper
Parity check matrices and product representations of squares
Combinatorica
2008-10-21Paper
On Dissemination Thresholds in Regular and Irregular Graph Classes
Lecture Notes in Computer Science
2008-04-15Paper
Disjoint Cycles: Integrality Gap, Hardness, and Approximation
Integer Programming and Combinatorial Optimization
2007-08-30Paper
Minimal paths and cycles in set systems
European Journal of Combinatorics
2007-07-27Paper
Rainbow Turán Problems
Combinatorics, Probability and Computing
2007-03-20Paper
Independent dominating sets and hamiltonian cycles
Journal of Graph Theory
2007-03-20Paper
Proof of a conjecture of Erdős on triangles in set-systems
Combinatorica
2007-01-02Paper
Product representations of polynomials
European Journal of Combinatorics
2006-11-15Paper
Cycle lengths in planar graphs2006-09-14Paper
Regular subgraphs of random graphs
Random Structures & Algorithms
2006-09-06Paper
On the Turán number for the hexagon
Advances in Mathematics
2006-08-04Paper
On the number of sets of cycle lengths
Combinatorica
2006-01-26Paper
A Note on Bipartite Graphs Without 2 k -Cycles
Combinatorics, Probability and Computing
2005-11-14Paper
Unavoidable cycle lengths in graphs
Journal of Graph Theory
2005-06-30Paper
Even cycles in hypergraphs
Journal of Combinatorial Theory. Series B
2005-05-04Paper
A note on graphs without short even cycles
The Electronic Journal of Combinatorics
2005-04-25Paper
A note on graphs without short even cycles
The Electronic Journal of Combinatorics
2005-04-25Paper
A note on graphs without short even cycles
The Electronic Journal of Combinatorics
2005-04-25Paper
Multicolour Turán problems
Advances in Applied Mathematics
2004-10-12Paper
A hypergraph extension of the bipartite Turán problem
Journal of Combinatorial Theory. Series A
2004-08-06Paper
On hypergraphs of girth five
The Electronic Journal of Combinatorics
2003-09-24Paper
On hypergraphs of girth five
The Electronic Journal of Combinatorics
2003-09-24Paper
Vertex-disjoint cycles of the same length.
Journal of Combinatorial Theory. Series B
2003-08-25Paper
A Note on Vertex-Disjoint Cycles
Combinatorics, Probability and Computing
2002-08-24Paper
On arithmetic progressions of cycle lengths in graphs
Combinatorics, Probability and Computing
2002-01-21Paper
Big line or big convex polygon
(available as arXiv preprint)
N/APaper
On the order of Erd\H{o}s-Rogers functions
(available as arXiv preprint)
N/APaper
On off-diagonal hypergraph Ramsey numbers
(available as arXiv preprint)
N/APaper
A question of Erd\H{o}s and Graham on Egyptian fractions
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: J. Verstraëte