2024
Large cliques or cocliques in hypergraphs with forbidden order-size pairs.
Comb. Probab. Comput., 2024
2023
Extremal Problems for Hypergraph Blowups of Trees.
SIAM J. Discret. Math., December, 2023
Hypergraph Ramsey numbers of cliques versus stars.
Random Struct. Algorithms, October, 2023
Triangles in graphs without bipartite suspensions.
Discret. Math., June, 2023
The feasible region of induced graphs.
J. Comb. Theory B, 2023
A unified approach to hypergraph stability.
J. Comb. Theory B, 2023
2022
Independent sets in hypergraphs omitting an intersection.
Random Struct. Algorithms, 2022
On a generalized Erdős-Rademacher problem.
J. Graph Theory, 2022
Extremal problems for pairs of triangles.
J. Comb. Theory B, 2022
On Explicit Constructions of Designs.
Electron. J. Comb., 2022
A Hypergraph Turán Problem with No Stability.
Comb., 2022
2021
The feasible region of hypergraphs.
J. Comb. Theory B, 2021
Partitioning ordered hypergraphs.
J. Comb. Theory A, 2021
Tight bounds for Katona's shadow intersection theorem.
Eur. J. Comb., 2021
2020
Extremal Theory of Locally Sparse Multigraphs.
SIAM J. Discret. Math., 2020
Ordered and Convex Geometric Trees with Linear Extremal Function.
Discret. Comput. Geom., 2020
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.
Discret. Appl. Math., 2020
2019
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math., 2019
Discrete Metric Spaces: Structure, Enumeration, and 0-1 Laws.
J. Symb. Log., 2019
An Extremal Graph Problem with a Transcendental Solution.
Comb. Probab. Comput., 2019
A note on Pseudorandom Ramsey graphs.
CoRR, 2019
Independence Number of Graphs with a Prescribed Number of Cliques.
Electron. J. Comb., 2019
The Number of Triple Systems Without Even Cycles.
Comb., 2019
2018
Constructions in Ramsey theory.
J. Lond. Math. Soc., 2018
Comb. Probab. Comput., 2018
2017
On the Size-Ramsey Number of Hypergraphs.
J. Graph Theory, 2017
Off-diagonal hypergraph Ramsey numbers.
J. Comb. Theory B, 2017
Turán problems and shadows II: Trees.
J. Comb. Theory B, 2017
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems.
Eur. J. Comb., 2017
Eigenvalues of non-regular linear quasirandom hypergraphs.
Discret. Math., 2017
Sparse hypergraphs with low independence number.
Comb., 2017
2016
Coloring Sparse Hypergraphs.
SIAM J. Discret. Math., 2016
Hamilton cycles in quasirandom hypergraphs.
Random Struct. Algorithms, 2016
Coloring Triple Systems with Local Conditions.
J. Graph Theory, 2016
Perfect packings in quasirandom hypergraphs I.
J. Comb. Theory B, 2016
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques.
Comb. Probab. Comput., 2016
Perfect Packings in Quasirandom Hypergraphs II.
Comb. Probab. Comput., 2016
On the Chromatic Thresholds of Hypergraphs.
Comb. Probab. Comput., 2016
Counting Trees in Graphs.
Electron. J. Comb., 2016
Inverse Expander Mixing for Hypergraphs.
Electron. J. Comb., 2016
2015
Turán Problems and Shadows III: Expansions of Graphs.
SIAM J. Discret. Math., 2015
The poset of hypergraph quasirandomness.
Random Struct. Algorithms, 2015
List coloring triangle-free hypergraphs.
Random Struct. Algorithms, 2015
Turán problems and shadows I: Paths and cycles.
J. Comb. Theory A, 2015
2014
Spectral Extremal Problems for Hypergraphs.
SIAM J. Discret. Math., 2014
On independent sets in hypergraphs.
Random Struct. Algorithms, 2014
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs.
J. Graph Theory, 2014
On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.
J. Graph Theory, 2014
A Ramsey-type result for geometric l-hypergraphs.
Eur. J. Comb., 2014
Multicolor Ramsey numbers for triple systems.
Discret. Math., 2014
Counting Independent Sets in Hypergraphs.
Comb. Probab. Comput., 2014
2013
Hypergraph Ramsey numbers: Triangles versus cliques.
J. Comb. Theory A, 2013
Coloring simple hypergraphs.
J. Comb. Theory B, 2013
Coloring the Cube with Rainbow Cycles.
Electron. J. Comb., 2013
Counting substructures II: Hypergraphs.
Comb., 2013
2012
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.
SIAM J. Discret. Math., 2012
The de Bruijn-Erdős theorem for hypergraphs.
Des. Codes Cryptogr., 2012
The Turán Number of <i>F</i><sub>3, 3</sub>.
Comb. Probab. Comput., 2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012
Almost all triangle-free triple systems are tripartite.
Comb., 2012
2011
Almost all triple systems with independent neighborhoods are semi-bipartite.
J. Comb. Theory A, 2011
2010
Coloring H-free hypergraphs.
Random Struct. Algorithms, 2010
Finding bipartite subgraphs efficiently.
Inf. Process. Lett., 2010
Set systems without a simplex or a cluster.
Comb., 2010
Hypergraphs with independent neighborhoods.
Comb., 2010
On Approximate Horn Formula Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
Two-regular subgraphs of hypergraphs.
J. Comb. Theory B, 2009
Set systems with union and intersection constraints.
J. Comb. Theory B, 2009
Comb. Probab. Comput., 2009
Erdos-Ko-Rado in Random Hypergraphs.
Comb. Probab. Comput., 2009
Bipartite Coverings and the Chromatic Number.
Electron. J. Comb., 2009
Combinatorial Problems for Horn Clauses.
Proceedings of the Graph Theory, 2009
2008
Quadruple systems with independent neighborhoods.
J. Comb. Theory A, 2008
A new short proof of a theorem of Ahlswede and Khachatrian.
J. Comb. Theory A, 2008
Constructions of non-principal families in extremal hypergraph theory.
Discret. Math., 2008
When is an Almost Monochromatic <i>K</i><sub>4</sub> Guaranteed?
Comb. Probab. Comput., 2008
Extremal Problems for t-Partite and t-Colorable Hypergraphs.
Electron. J. Comb., 2008
On the Chromatic Number of Simple Triangle-Free Triple Systems.
Electron. J. Comb., 2008
2007
On the independence number of the Erdös-Rényi and projective norm graphs and a related hypergraph.
J. Graph Theory, 2007
Co-degree density of hypergraphs.
J. Comb. Theory A, 2007
On the chromatic number and independence number of hypergraph products.
J. Comb. Theory B, 2007
A new generalization of Mantel's theorem to k-graphs.
J. Comb. Theory B, 2007
Forbidding Complete Hypergraphs as Traces.
Graphs Comb., 2007
Minimal paths and cycles in set systems.
Eur. J. Comb., 2007
The inverse protein folding problem on 2D and 3D lattices.
Discret. Appl. Math., 2007
Comb. Probab. Comput., 2007
2006
The DNF exception problem.
Theor. Comput. Sci., 2006
On the edge-bandwidth of graph products.
Theor. Comput. Sci., 2006
Set Systems with No Singleton Intersection.
SIAM J. Discret. Math., 2006
Explicit constructions of triple systems for Ramsey-Turán problems.
J. Graph Theory, 2006
A hypergraph extension of Turán's theorem.
J. Comb. Theory B, 2006
Erdos-Ko-Rado for three sets.
J. Comb. Theory A, 2006
Supersaturation For Ramsey-Turán Problems.
Comb., 2006
2005
Constructions of bipartite graphs from finite geometries.
J. Graph Theory, 2005
Non-uniform Turán-type problems.
J. Comb. Theory A, 2005
The co-degree density of the Fano plane.
J. Comb. Theory B, 2005
Proof Of A Conjecture Of Erdös On Triangles In Set-Systems.
Comb., 2005
2004
How many disjoint 2-edge paths must a cubic graph have?
J. Graph Theory, 2004
A hypergraph extension of the bipartite Turán problem.
J. Comb. Theory A, 2004
Stability theorems for cancellative hypergraphs.
J. Comb. Theory B, 2004
A family of switch equivalent graphs.
Discret. Math., 2004
Uniform Edge Distribution in Hypergraphs is Hereditary.
Electron. J. Comb., 2004
An Explicit Construction for a Ramsey Problem.
Comb., 2004
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004
2003
Coloring with three-colored subgraphs.
J. Graph Theory, 2003
On a Two-Sided Turan Problem.
Electron. J. Comb., 2003
On Hypergraphs with Every Four Points Spanning at Most Two Triples.
Electron. J. Comb., 2003
2002
On the Turán Number of Triple Systems.
J. Comb. Theory A, 2002
Intersecting Curves in the Plane.
Graphs Comb., 2002
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb., 2002
On restricted edge-colorings of bicliques.
Discret. Math., 2002
Some Exact Results And New Asymptotics For Hypergraph Turán Numbers.
Comb. Probab. Comput., 2002
Generalizing the Ramsey Problem through Diameter.
Electron. J. Comb., 2002
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs.
Adv. Appl. Math., 2002
2001
On the chromatic number of set systems.
Random Struct. Algorithms, 2001
Large induced forests in sparse graphs.
J. Graph Theory, 2001
Minimal Completely Separating Systems of k-Sets.
J. Comb. Theory A, 2001
Realizing degree imbalances in directed graphs.
Discret. Math., 2001
Asymptotically Optimal Tree-Packings in Regular Graphs.
Electron. J. Comb., 2001
2000
Correction to Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 2000
Graphic sequences that have a realization with large clique number.
J. Graph Theory, 2000
Multiple vertex coverings by specified induced subgraphs.
J. Graph Theory, 2000
The edge-bandwidth of theta graphs.
J. Graph Theory, 2000
On Generalized Ramsey Theory: The Bipartite Case.
J. Comb. Theory B, 2000
On the Number of Vertices with Specified Eccentricity.
Graphs Comb., 2000
New Upper Bounds for a Canonical Ramsey Problem.
Comb., 2000
Edge-Coloring Cliques with Many Colors on Subcliques.
Comb., 2000
1999
Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 1999
Signed Domination in Regular Graphs and Set-Systems.
J. Comb. Theory B, 1999
Chromatic spectrum is broken.
Electron. Notes Discret. Math., 1999
1998
Connectivity and separating sets of cages.
J. Graph Theory, 1998
Edge-Coloring Cliques with Three Colors on All 4-Cliques.
Comb., 1998
