Jacques Verstraëte

SIAM J. Discret. Math., December, 2023

Hypergraph Ramsey numbers of cliques versus stars.

[BibT_eX]

[DOI]

Random Struct. Algorithms, October, 2023

2022

Ramsey Numbers for Nontrivial Berge Cycles.

[BibT_eX]

[DOI]

Jiaxi Nie

SIAM J. Discret. Math., 2022

Counting hypergraphs with large girth.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Extremal problems for pairs of triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

A Note on k-Wise Oddtown Problems.

[BibT_eX]

[DOI]

Jason O'Neill

Graphs Comb., 2022

On asymptotic packing of geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Relative Turán Problems for Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth.

[BibT_eX]

[DOI]

Jiaxi Nie

Random Struct. Algorithms, 2021

Non-trivial <i>d</i>-wise intersecting families.

[BibT_eX]

[DOI]

Jason O'Neill

J. Comb. Theory A, 2021

Partitioning ordered hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Triangle-Free Subgraphs of Hypergraphs.

[BibT_eX]

[DOI]

Jiaxi Nie

Graphs Comb., 2021

Relative Turán numbers for hypergraph cycles.

[BibT_eX]

[DOI]

Discret. Math., 2021

Independent dominating sets in graphs of girth five.

[BibT_eX]

[DOI]

Ararat Harutyunyan

Paul Horn

Comb. Probab. Comput., 2021

A Generalization of the Bollobás Set Pairs Inequality.

[BibT_eX]

[DOI]

Jason O'Neill

Electron. J. Comb., 2021

2020

Ordered and Convex Geometric Trees with Linear Extremal Function.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Graphs without theta subgraphs.

[BibT_eX]

[DOI]

Jason Williford

J. Comb. Theory B, 2019

A note on Pseudorandom Ramsey graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Full subgraphs.

[BibT_eX]

[DOI]

Victor Falgas-Ravry

Klas Markström

J. Graph Theory, 2018

Stability in the Erdős-Gallai Theorem on cycles and paths, II.

[BibT_eX]

[DOI]

Ruth Luo

Discret. Math., 2018

2017

Turán problems and shadows II: Trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

The Extremal Function for Cycles of Length l mod k.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Cycles in triangle-free graphs of large chromatic number.

[BibT_eX]

[DOI]

Comb., 2017

2016

Stability in the Erdős-Gallai Theorems on cycles and paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

On sets of integers with restrictions on their products.

[BibT_eX]

[DOI]

Michael Tait

Eur. J. Comb., 2016

Counting Trees in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Turán Problems and Shadows III: Expansions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Turán problems and shadows I: Paths and cycles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

A counterexample to sparse removal.

[BibT_eX]

[DOI]

Craig Timmons

Eur. J. Comb., 2015

Probabilistic constructions in generalized quadrangles.

[BibT_eX]

[DOI]

Jeroen Schillewaert

Discret. Math., 2015

On coupon colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

On independent sets in hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

Turán numbers of bipartite graphs plus an odd cycle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

2013

Hypergraph Ramsey numbers: Triangles versus cliques.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

On the Independence Number of Steiner Systems.

[BibT_eX]

[DOI]

Alex Eustis

Comb. Probab. Comput., 2013

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes.

[BibT_eX]

[DOI]

Michael Tait

Alexander Vardy

CoRR, 2013

On a conjecture of Erdős and Simonovits: Even cycles.

[BibT_eX]

[DOI]

Peter Keevash

Comb., 2013

2012

The de Bruijn-Erdős theorem for hypergraphs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Comb. Probab. Comput., 2012

Large Incidence-free Sets in Geometries.

[BibT_eX]

[DOI]

Stefaan De Winter

Jeroen Schillewaert

Electron. J. Comb., 2012

2011

On the threshold for k-regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Pawel Pralat

Nicholas C. Wormald

Comb., 2011

On Dissemination Thresholds in Regular and Irregular Graph Classes.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

List Coloring Hypergraphs.

[BibT_eX]

[DOI]

Penny E. Haxell

Electron. J. Comb., 2010

2009

The maximum size of hypergraphs without generalized 4-cycles.

[BibT_eX]

[DOI]

Oleg Pikhurko

J. Comb. Theory A, 2009

Two-regular subgraphs of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

On decompositions of complete hypergraphs.

[BibT_eX]

[DOI]

Sebastian M. Cioaba

André Kündgen

J. Comb. Theory A, 2009

2008

Clique partitions of complements of forests and bounded degree graphs.

[BibT_eX]

[DOI]

Michael Cavers

Discret. Math., 2008

An Extremal Characterization of Projective Planes.

[BibT_eX]

[DOI]

Stefaan De Winter

Felix Lazebnik

Electron. J. Comb., 2008

A Note on Polynomials and f-Factors of Graphs.

[BibT_eX]

[DOI]

Hamed Shirazi

Electron. J. Comb., 2008

Cycle lengths in sparse graphs.

[BibT_eX]

[DOI]

Comb., 2008

Parity check matrices and product representations of squares.

[BibT_eX]

[DOI]

Assaf Naor

Comb., 2008

2007

Approximation algorithms and hardness results for cycle packing problems.

[BibT_eX]

[DOI]

Michael Krivelevich

Zeev Nutov

Mohammad R. Salavatipour

Raphael Yuster

ACM Trans. Algorithms, 2007

Independent dominating sets and hamiltonian cycles.

[BibT_eX]

[DOI]

Penny E. Haxell

Ben Seamone

J. Graph Theory, 2007

Minimal paths and cycles in set systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Rainbow Turán Problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

Regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Béla Bollobás

Jeong Han Kim

Random Struct. Algorithms, 2006

Product representations of polynomials.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

2005

Unavoidable cycle lengths in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Even cycles in hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

A Note on Graphs Without Short Even Cycles.

[BibT_eX]

[DOI]

Thomas Lam

Electron. J. Comb., 2005

Proof Of A Conjecture Of Erdös On Triangles In Set-Systems.

[BibT_eX]

[DOI]

Comb., 2005

Improved bounds on the size of sparse parity check matrices.

[BibT_eX]

[DOI]

Assaf Naor

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Disjoint Cycles: Integrality Gap, Hardness, and Approximation.

[BibT_eX]

[DOI]

Mohammad R. Salavatipour

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

A hypergraph extension of the bipartite Turán problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

On The Number Of Sets Of Cycle Lengths.

[BibT_eX]

[DOI]

Comb., 2004

Multicolour Turán problems.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Vertex-disjoint cycles of the same length.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

On Hypergraphs of Girth Five.

[BibT_eX]

[DOI]

Felix Lazebnik

Electron. J. Comb., 2003

2002

A Note On Vertex-Disjoint Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

2000

On Arithmetic Progressions Of Cycle Lengths In Graphs.

[BibT_eX]

[DOI]