Dhruv Mubayi

Comb. Probab. Comput., 2026

Conflict-free hypergraph matchings and coverings.

[BibT_eX]

[DOI]

Felix Joos

Zak Smith

Comb. Probab. Comput., 2026

Big line or big convex polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2026

2025

Ordered and Colored Subgraph Density Problems.

[BibT_eX]

[DOI]

Emily Cairncross

SIAM J. Discret. Math., 2025

2024

Ramsey numbers of cliques versus monotone paths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Turán problems in pseudorandom graphs.

[BibT_eX]

[DOI]

David Munhá Correia

Comb. Probab. Comput., 2024

Large cliques or cocliques in hypergraphs with forbidden order-size pairs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

2023

Extremal Problems for Hypergraph Blowups of Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Hypergraph Ramsey numbers of cliques versus stars.

[BibT_eX]

[DOI]

Random Struct. Algorithms, October, 2023

Triangles in graphs without bipartite suspensions.

[BibT_eX]

[DOI]

Sayan Mukherjee

Discret. Math., June, 2023

The feasible region of induced graphs.

[BibT_eX]

[DOI]

Christian Reiher

J. Comb. Theory B, 2023

A unified approach to hypergraph stability.

[BibT_eX]

[DOI]

Christian Reiher

J. Comb. Theory B, 2023

2022

Independent sets in hypergraphs omitting an intersection.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

On a generalized Erdős-Rademacher problem.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Extremal problems for pairs of triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

On Explicit Constructions of Designs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

A Hypergraph Turán Problem with No Stability.

[BibT_eX]

[DOI]

Comb., 2022

2021

The feasible region of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Partitioning ordered hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Tight bounds for Katona's shadow intersection theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

2020

Extremal Theory of Locally Sparse Multigraphs.

[BibT_eX]

[DOI]

Caroline Terry

SIAM J. Discret. Math., 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

Discrete Metric Spaces: Structure, Enumeration, and 0-1 Laws.

[BibT_eX]

[DOI]

Caroline Terry

J. Symb. Log., 2019

An Extremal Graph Problem with a Transcendental Solution.

[BibT_eX]

[DOI]

Caroline Terry

Comb. Probab. Comput., 2019

A note on Pseudorandom Ramsey graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Independence Number of Graphs with a Prescribed Number of Cliques.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

The Number of Triple Systems Without Even Cycles.

[BibT_eX]

[DOI]

Lujia Wang

Comb., 2019

2018

Constructions in Ramsey theory.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2018

Multicolour Sunflowers.

[BibT_eX]

[DOI]

Lujia Wang

Comb. Probab. Comput., 2018

2017

On the Size-Ramsey Number of Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Off-diagonal hypergraph Ramsey numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Turán problems and shadows II: Trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Eigenvalues of non-regular linear quasirandom hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Sparse hypergraphs with low independence number.

[BibT_eX]

[DOI]

Comb., 2017

2016

Coloring Sparse Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Hamilton cycles in quasirandom hypergraphs.

[BibT_eX]

[DOI]

Richard Mycroft

Random Struct. Algorithms, 2016

Coloring Triple Systems with Local Conditions.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Perfect packings in quasirandom hypergraphs I.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Perfect Packings in Quasirandom Hypergraphs II.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

On the Chromatic Thresholds of Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Counting Trees in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Inverse Expander Mixing for Hypergraphs.

[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

The poset of hypergraph quasirandomness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

List coloring triangle-free hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

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

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

2014

Spectral Extremal Problems for Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

On independent sets in hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Andrzej Dudek

J. Graph Theory, 2014

Multicolor Ramsey numbers for triple systems.

[BibT_eX]

[DOI]

Discret. Math., 2014

Counting Independent Sets in Hypergraphs.

[BibT_eX]

[DOI]

Kunal Dutta

Comb. Probab. Comput., 2014

2013

Hypergraph Ramsey numbers: Triangles versus cliques.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Coloring simple hypergraphs.

[BibT_eX]

[DOI]

Alan M. Frieze

J. Comb. Theory B, 2013

Coloring the Cube with Rainbow Cycles.

[BibT_eX]

[DOI]

Randall Stading

Electron. J. Comb., 2013

Counting substructures II: Hypergraphs.

[BibT_eX]

[DOI]

Comb., 2013

A Ramsey-Type Result for Geometric ℓ-Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Kunal Dutta

C. R. Subramanian

SIAM J. Discret. Math., 2012

Books Versus triangles.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

The de Bruijn-Erdős theorem for hypergraphs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

The Turán Number of F3, 3.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Comb. Probab. Comput., 2012

Two-Part Set Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Almost all triangle-free triple systems are tripartite.

[BibT_eX]

[DOI]

Comb., 2012

2011

Almost all triple systems with independent neighborhoods are semi-bipartite.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

2010

Coloring H-free hypergraphs.

[BibT_eX]

[DOI]

Alan M. Frieze

Random Struct. Algorithms, 2010

Finding bipartite subgraphs efficiently.

[BibT_eX]

[DOI]

György Turán

Inf. Process. Lett., 2010

Set systems without a simplex or a cluster.

[BibT_eX]

[DOI]

Comb., 2010

Hypergraphs with independent neighborhoods.

[BibT_eX]

[DOI]

Comb., 2010

On Approximate Horn Formula Minimization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Two-regular subgraphs of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Set systems with union and intersection constraints.

[BibT_eX]

[DOI]

Reshma Ramadurai

J. Comb. Theory B, 2009

Simplex Stability.

[BibT_eX]

[DOI]

Reshma Ramadurai

Comb. Probab. Comput., 2009

Erdos-Ko-Rado in Random Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Bipartite Coverings and the Chromatic Number.

[BibT_eX]

[DOI]

Sundar Vishwanathan

Electron. J. Comb., 2009

2008

Quadruple systems with independent neighborhoods.

[BibT_eX]

[DOI]

Oleg Pikhurko

J. Comb. Theory A, 2008

A new short proof of a theorem of Ahlswede and Khachatrian.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Constructions of non-principal families in extremal hypergraph theory.

[BibT_eX]

[DOI]

Oleg Pikhurko

Discret. Math., 2008

When is an Almost Monochromatic K4 Guaranteed?

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

Extremal Problems for t-Partite and t-Colorable Hypergraphs.

[BibT_eX]

[DOI]

John M. Talbot

Electron. J. Comb., 2008

On the Chromatic Number of Simple Triangle-Free Triple Systems.

[BibT_eX]

[DOI]

Alan M. Frieze

Electron. J. Comb., 2008

Combinatorial problems for Horn clauses.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

2007

On the independence number of the Erdös-Rényi and projective norm graphs and a related hypergraph.

[BibT_eX]

[DOI]

Jason Williford

J. Graph Theory, 2007

Co-degree density of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

On the chromatic number and independence number of hypergraph products.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

A new generalization of Mantel's theorem to k-graphs.

[BibT_eX]

[DOI]

Oleg Pikhurko

J. Comb. Theory B, 2007

Forbidding Complete Hypergraphs as Traces.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Minimal paths and cycles in set systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

The inverse protein folding problem on 2D and 3D lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Rainbow Turán Problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

2006

The DNF exception problem.

[BibT_eX]

[DOI]

György Turán

Theor. Comput. Sci., 2006

On the edge-bandwidth of graph products.

[BibT_eX]

[DOI]

András Pluhár

Theor. Comput. Sci., 2006

Set Systems with No Singleton Intersection.

[BibT_eX]

[DOI]

Richard M. Wilson

SIAM J. Discret. Math., 2006

Explicit constructions of triple systems for Ramsey-Turán problems.

[BibT_eX]

[DOI]

Vera T. Sós

J. Graph Theory, 2006

A hypergraph extension of Turán's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Erdos-Ko-Rado for three sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Supersaturation For Ramsey-Turán Problems.

[BibT_eX]

[DOI]

Comb., 2006

2005

Constructions of bipartite graphs from finite geometries.

[BibT_eX]

[DOI]

Keith E. Mellinger

J. Graph Theory, 2005

Non-uniform Turán-type problems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2005

The co-degree density of the Fano plane.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

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

[BibT_eX]

[DOI]

Comb., 2005

2004

How many disjoint 2-edge paths must a cubic graph have?

[BibT_eX]

[DOI]

Alexander K. Kelmans

J. Graph Theory, 2004

A hypergraph extension of the bipartite Turán problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

Stability theorems for cancellative hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

A family of switch equivalent graphs.

[BibT_eX]

[DOI]

Bertrand Guenin

Prasad Tetali

Discret. Math., 2004

Uniform Edge Distribution in Hypergraphs is Hereditary.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

An Explicit Construction for a Ramsey Problem.

[BibT_eX]

[DOI]

Comb., 2004

The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Coloring with three-colored subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

On a Two-Sided Turan Problem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

On Hypergraphs with Every Four Points Spanning at Most Two Triples.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

2002

On the Turán Number of Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Intersecting Curves in the Plane.

[BibT_eX]

[DOI]

Graphs Comb., 2002

The Chromatic Spectrum of Mixed Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

On restricted edge-colorings of bicliques.

[BibT_eX]

[DOI]

Discret. Math., 2002

Some Exact Results And New Asymptotics For Hypergraph Turán Numbers.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Generalizing the Ramsey Problem through Diameter.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Felix Lazebnik

Adv. Appl. Math., 2002

2001

On the chromatic number of set systems.

[BibT_eX]

[DOI]

Prasad Tetali

Random Struct. Algorithms, 2001

Large induced forests in sparse graphs.

[BibT_eX]

[DOI]

Noga Alon

Robin Thomas

J. Graph Theory, 2001

Minimal Completely Separating Systems of k-Sets.

[BibT_eX]

[DOI]

André Kündgen

Prasad Tetali

J. Comb. Theory A, 2001

Realizing degree imbalances in directed graphs.

[BibT_eX]

[DOI]

Todd G. Will

Discret. Math., 2001

Asymptotically Optimal Tree-Packings in Regular Graphs.

[BibT_eX]

[DOI]

Alexander K. Kelmans

Benny Sudakov

Electron. J. Comb., 2001

2000

Correction to Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Graphic sequences that have a realization with large clique number.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Multiple vertex coverings by specified induced subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

The edge-bandwidth of theta graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

On Generalized Ramsey Theory: The Bipartite Case.

[BibT_eX]

[DOI]

Maria Axenovich

J. Comb. Theory B, 2000

On the Number of Vertices with Specified Eccentricity.

[BibT_eX]

[DOI]

Graphs Comb., 2000

New Upper Bounds for a Canonical Ramsey Problem.

[BibT_eX]

[DOI]

Comb., 2000

Edge-Coloring Cliques with Many Colors on Subcliques.

[BibT_eX]

[DOI]

Dennis Eichhorn

Comb., 2000

1999

Edge-Bandwidth of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Signed Domination in Regular Graphs and Set-Systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Chromatic spectrum is broken.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

1998

Connectivity and separating sets of cages.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Edge-Coloring Cliques with Three Colors on All 4-Cliques.

[BibT_eX]

[DOI]