The following pages link to Jacques Verstraete (Q311563):
Displaying 50 items.
- Counting trees in graphs (Q311564) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- (Q472165) (redirect page) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- A counterexample to sparse removal (Q472399) (← links)
- On sets of integers with restrictions on their products (Q499476) (← links)
- The extremal function for cycles of length \(\ell\) mod \(k\) (Q510312) (← links)
- (Q627517) (redirect page) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Cycles in graphs with large independence ratio (Q635856) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- On the number of sets of cycle lengths (Q812791) (← links)
- Product representations of polynomials (Q850085) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- Clique partitions of complements of forests and bounded degree graphs (Q952663) (← links)
- A note on polynomials and \(f\)-factors of graphs (Q1010679) (← links)
- An extremal characterization of projective planes (Q1010880) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- On decompositions of complete hypergraphs (Q1040837) (← links)
- Vertex-disjoint cycles of the same length. (Q1405099) (← links)
- On hypergraphs of girth five (Q1408529) (← links)
- Graphs without theta subgraphs (Q1633744) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Cycles in triangle-free graphs of large chromatic number (Q1743172) (← links)
- A note on graphs without short even cycles (Q1773215) (← links)
- Even cycles in hypergraphs (Q1775899) (← links)
- A hypergraph extension of the bipartite Turán problem (Q1826942) (← links)
- Multicolour Turán problems (Q1883379) (← links)
- Large incidence-free sets in geometries (Q1953330) (← links)
- List coloring hypergraphs (Q1960283) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- A note on \(k\)-wise oddtown problems (Q2143418) (← links)
- Ordered and convex geometric trees with linear extremal function (Q2197686) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 (Q2309552) (← links)
- Hypergraph Ramsey numbers: triangles versus cliques (Q2349183) (← links)
- On coupon colorings of graphs (Q2354722) (← links)
- Proof of a conjecture of Erdős on triangles in set-systems (Q2368590) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- Probabilistic constructions in generalized quadrangles (Q2407032) (← links)
- On the threshold for \(k\)-regular subgraphs of random graphs (Q2428631) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
