#### Filter Results:

- Full text PDF available (44)

#### Publication Year

2000

2018

- This year (2)
- Last 5 years (22)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Felix Lazebnik, Jacques Verstraëte
- Electr. J. Comb.
- 2003

In this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing the definition of a hypergraph cycle due to Berge. In particular, for r = 3, we show that if H has n… (More)

- Jacques Verstraëte
- Combinatorics, Probability & Computing
- 2000

A recently posed question of Häggkvist and Scott’s asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths.… (More)

In this note, we study the maximum number of edges in an m by n bipartite graph containing no 2k-cycles. This problem was studied in the papers by Erdős, Sós and Sárközy [3] and by Győri [4], in the… (More)

- Assaf Naor, Jacques Verstraëte
- Combinatorica
- 2008

Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are linearly… (More)

- Dhruv Mubayi, Jacques Verstraëte
- Combinatorica
- 2005

A triangle is a family of three sets A,B,C such that A∩B, B∩C, C∩A are each nonempty, and A ∩ B ∩ C = ∅. Let A be a family of r-element subsets of an n-element set, containing no triangle. Our main… (More)

- Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte
- J. Comb. Theory, Ser. B
- 2014

Article history: Received 12 October 2012 Available online 14 February 2014

- Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
- SIAM J. Discrete Math.
- 2015

The expansion G of a graph G is the 3-uniform hypergraph obtained from G by enlarging each edge of G with a new vertex disjoint from V (G) such that distinct edges are enlarged by distinct vertices.… (More)

- Benny Sudakov, Jacques Verstraëte
- Combinatorica
- 2008

Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value of |C(G)| over all graphs G of average degree d and girth g. Erdős [8]… (More)

The r-expansion G of a graph G is the r-uniform hypergraph obtained from G by enlarging each edge of G with a vertex subset of size r − 2 disjoint from V (G) such that distinct edges are enlarged by… (More)

- Dhruv Mubayi, Jacques Verstraëte
- J. Comb. Theory, Ser. B
- 2009

We prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing no 2-regular subhypergraph is ( n−1 k−1 ) if k ≥ 4 is even and n is sufficiently large. Equality holds… (More)