2024
Minimal abundant packings and choosability with separation.
Des. Codes Cryptogr., December, 2024
2023
Extremal Problems for Hypergraph Blowups of Trees.
SIAM J. Discret. Math., December, 2023
Induced Turán problems and traces of hypergraphs.
Eur. J. Comb., June, 2023
An Upper Bound on the Size of Sidon Sets.
Am. Math. Mon., May, 2023
Problems and results on 1-cross-intersecting set pair systems.
Comb. Probab. Comput., 2023
2022
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition.
SIAM J. Discret. Math., 2022
Extremal problems for pairs of triangles.
J. Comb. Theory B, 2022
Turán number of special four cycles in triple systems.
Discret. Math., 2022
2021
Partitioning ordered hypergraphs.
J. Comb. Theory A, 2021
Hypergraphs without exponents.
J. Comb. Theory A, 2021
Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs.
Electron. J. Comb., 2021
2020
An Extension of Mantel's Theorem to k-Graphs.
Am. Math. Mon., 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
Berge Cycles in Non-Uniform Hypergraphs.
Electron. J. Comb., 2020
2019
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math., 2019
Avoiding long Berge cycles.
J. Comb. Theory B, 2019
A variation of a theorem by Pósa.
Discret. Math., 2019
List-distinguishing Cartesian products of cliques.
Discret. Math., 2019
On 2-Connected Hypergraphs with No Long Cycles.
Electron. J. Comb., 2019
2018
Extensions of a theorem of Erdős on nonhamiltonian graphs.
J. Graph Theory, 2018
Stability in the Erdős-Gallai Theorem on cycles and paths, II.
Discret. Math., 2018
2017
Kneser ranks of random graphs and minimum difference representations.
Electron. Notes Discret. Math., 2017
A stability version for a theorem of Erdős on nonhamiltonian graphs.
Discret. Math., 2017
On 3-uniform hypergraphs without a cycle of a given length.
Discret. Appl. Math., 2017
Preface: Levon Khachatrian's legacy in extremal combinatorics.
Discret. Appl. Math., 2017
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs.
Comb. Probab. Comput., 2017
2016
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs.
J. Graph Theory, 2016
Stability in the Erdős-Gallai Theorems on cycles and paths.
J. Comb. Theory B, 2016
2015
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity.
J. Comb. Theory B, 2015
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.
Eur. J. Comb., 2015
Extremal Numbers for Odd Cycles.
Comb. Probab. Comput., 2015
2014
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.
J. Graph Theory, 2014
Hypergraph Turán numbers of linear cycles.
J. Comb. Theory A, 2014
Linear trees in uniform hypergraphs.
Eur. J. Comb., 2014
Exact solution of the hypergraph Turán problem for k-uniform linear paths.
Comb., 2014
A coding problem for pairs of subsets.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014
2013
Cycle-Saturated Graphs with Minimum Number of Edges.
J. Graph Theory, 2013
Large Chromatic Number and Ramsey Graphs.
Graphs Comb., 2013
The structure of the typical graphs of given diameter.
Discret. Math., 2013
Intersection Representations of the Complete Bipartite Graph.
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Optimal Multivalued Shattering.
SIAM J. Discret. Math., 2012
Large B<sub>d</sub>-Free and Union-free Subfamilies.
SIAM J. Discret. Math., 2012
A new short proof of the EKR theorem.
J. Comb. Theory A, 2012
Some new bounds on partition critical hypergraphs.
Eur. J. Comb., 2012
2-Cancellative Hypergraphs and Codes.
Comb. Probab. Comput., 2012
2011
Covers for closed curves of length two.
Period. Math. Hung., 2011
Completing partial packings of bipartite graphs.
J. Comb. Theory A, 2011
Unavoidable subhypergraphs: a-clusters.
J. Comb. Theory A, 2011
On even-cycle-free subgraphs of the hypercube.
J. Comb. Theory A, 2011
Reverse-free codes and permutations.
Electron. Notes Discret. Math., 2011
Minimum Ck-saturated graphs.
Electron. Notes Discret. Math., 2011
Linear paths and trees in uniform hypergraphs.
Electron. Notes Discret. Math., 2011
Large Bd-free and union-free subfamilies.
Electron. Notes Discret. Math., 2011
2010
Tight embeddings of partial quadrilateral packings.
J. Comb. Theory A, 2010
2009
Partition Critical Hypergraphs.
Electron. Notes Discret. Math., 2009
On 14-Cycle-Free Subgraphs of the Hypercube.
Comb. Probab. Comput., 2009
2008
Inequalities for the first-fit chromatic number.
J. Graph Theory, 2008
Quadruple systems with independent neighborhoods.
J. Comb. Theory A, 2008
Covering the n-space by convex bodies and its chromatic number.
Discret. Math., 2008
Large convex cones in hypercubes.
Discret. Appl. Math., 2008
2007
Tree representations of graphs.
Eur. J. Comb., 2007
Covering a Triangle with Positive and Negative Homothetic Copies.
Discret. Comput. Geom., 2007
2006
Moments of graphs in monotone families.
J. Graph Theory, 2006
On set systems with a threshold property.
Discret. Math., 2006
Comb. Probab. Comput., 2006
2005
Two-Part and <i>k</i>-Sperner Families: New Proofs Using Permutations.
SIAM J. Discret. Math., 2005
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
J. Graph Theory, 2005
Minimum vertex-diameter-2-critical graphs.
J. Graph Theory, 2005
Triple Systems Not Containing a Fano Configuration.
Comb. Probab. Comput., 2005
Connected matchings and Hadwiger's conjecture.
Comb. Probab. Comput., 2005
2004
Distance graph on Z<sup>n</sup>with norm.
Theor. Comput. Sci., 2004
Minimal length test vectors for multiple-fault detection.
Theor. Comput. Sci., 2004
Extremal set systems with restricted k-wise intersections.
J. Comb. Theory A, 2004
Multiply intersecting families of sets.
J. Comb. Theory A, 2004
2003
Exact Bounds on the Sizes of Covering Codes.
Des. Codes Cryptogr., 2003
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electron. J. Comb., 2003
2002
On splittable colorings of graphs and hypergraphs.
J. Graph Theory, 2002
Turán problems for integer-weighted graphs.
J. Graph Theory, 2002
On the maximum size of (<i>p, Q</i>)-free families.
Discret. Math., 2002
Hamiltonian Kneser Graphs.
Comb., 2002
2001
Embedding of graphs in two-irregular graphs.
J. Graph Theory, 2001
Covering Non-uniform Hypergraphs.
J. Comb. Theory B, 2001
Ramsey Theory and Bandwidth of Graphs.
Graphs Comb., 2001
Maximal t-Critical Linear Hypergraphs.
Graphs Comb., 2001
On the Maximum Size of (p, Q) - free Families.
Electron. Notes Discret. Math., 2001
Covering a graph with cuts of minimum total size.
Discret. Math., 2001
On the lattice diameter of a convex polygon.
Discret. Math., 2001
2000
Multiple vertex coverings by specified induced subgraphs.
J. Graph Theory, 2000
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.
J. Comb. Theory B, 2000
On Generalized Ramsey Theory: The Bipartite Case.
J. Comb. Theory B, 2000
1999
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes.
IEEE Trans. Inf. Theory, 1999
Signed Domination in Regular Graphs and Set-Systems.
J. Comb. Theory B, 1999
Induced subgraphs of given sizes.
Discret. Math., 1999
1998
Minimal Oriented Graphs of Diameter 2.
Graphs Comb., 1998
On the Double Competition Number.
Discret. Appl. Math., 1998
Difference Sets and Computability Theory.
Ann. Pure Appl. Log., 1998
1997
On the existence of countable universal graphs.
J. Graph Theory, 1997
Nonexistence of Universal Graphs Without Some Trees.
Comb., 1997
1996
Scrambling permutations and entropy of hypergraphs.
Random Struct. Algorithms, 1996
On the Number of Edges of Quadrilateral-Free Graphs.
J. Comb. Theory, Ser. B, 1996
On r-Cover-free Families.
J. Comb. Theory A, 1996
New Asymptotics for Bipartite Turán Numbers.
J. Comb. Theory A, 1996
An Upper Bound on Zarankiewicz' Problem.
Comb. Probab. Comput., 1996
Difference Sets and Inverting the Difference Operator.
Comb., 1996
1995
Graphs of Prescribed Girth and Bi-Degree.
J. Comb. Theory B, 1995
Cross-Intersecting Families of Finite Sets.
J. Comb. Theory A, 1995
Extremal Graphs for Intersecting Triangles.
J. Comb. Theory B, 1995
1994
Random Ramsey graphs for the four-cycle.
Discret. Math., 1994
Intersecting designs from linear programming and graphs of diameter two.
Discret. Math., 1994
On the Maximum Number of Triangles in Wheel-Free Graphs.
Comb. Probab. Comput., 1994
1993
Covering the Cube by Affine Hyperplanes.
Eur. J. Comb., 1993
On the fractional matching polytope of a hypergraph.
Comb., 1993
1992
Volumes Spanned by Random Points in the Hypercube.
Random Struct. Algorithms, 1992
The maximum number of edges in a minimal graph of diameter 2.
J. Graph Theory, 1992
Sets of vectors with many orthogonal paris.
Graphs Comb., 1992
Spanning subgraphs of random graphs.
Graphs Comb., 1992
Davenport-Schinzel theory of matrices.
Discret. Math., 1992
Indecomposable regular graphs and hypergraphs.
Discret. Math., 1992
Point Selections and Weak e-Nets for Convex Hulls.
Comb. Probab. Comput., 1992
1991
Maximal Independent Subsets in Steiner Systems and in Planar Sets.
SIAM J. Discret. Math., 1991
Midpoints of Diagonals of Convex <i>n</i>-GONS.
SIAM J. Discret. Math., 1991
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory A, 1991
Covering t-element Sets by Partitions.
Eur. J. Comb., 1991
A sharpening of Fisher's inequality.
Discret. Math., 1991
Saturated r-uniform hypergraphs.
Discret. Math., 1991
The Densest Packing of Equal Circles into a Parallel Strip.
Discret. Comput. Geom., 1991
On a Turán type problem of Erdös.
Comb., 1991
1990
Competition Graphs and Clique Dimensions.
Random Struct. Algorithms, 1990
Representations of families of triples over <i>GF</i>(2).
J. Comb. Theory A, 1990
Covering pairs by <i>q</i><sup>2</sup> + <i>q</i> + 1 sets.
J. Comb. Theory A, 1990
The maximum number of unit distances in a convex <i>n</i>-gon.
J. Comb. Theory A, 1990
Graphs of diameter 3 with the minimum number of edges.
Graphs Comb., 1990
Sphere coverings of the hypercube with incomparable centers.
Discret. Math., 1990
Perfect error-correcting databases.
Discret. Appl. Math., 1990
On the number of halving planes.
Comb., 1990
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990
Random Volumes in the n-Cube.
Proceedings of the Polyhedral Combinatorics, 1990
1989
Pair Labeelings with Given Distance.
SIAM J. Discret. Math., 1989
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory A, 1989
Maximal intersecting families and affine regular polygons in <i>PG</i>(2, <i>q</i>).
J. Comb. Theory A, 1989
A minimal cutset of the boolean lattice with almost all members.
Graphs Comb., 1989
Legitimate colorings of projective planes.
Graphs Comb., 1989
Covering the complete graph by partitions.
Discret. Math., 1989
A projective plane is an outstanding 2-cover.
Discret. Math., 1989
On Representing Sylvester- Gallai Designs.
Discret. Comput. Geom., 1989
1988
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discret. Math., 1988
On induced subgraphs of the cube.
J. Comb. Theory A, 1988
Matchings and covers in hypergraphs.
Graphs Comb., 1988
Rectangular Dissections of a Square.
Eur. J. Comb., 1988
Multicolored lines in a finite geometry.
Discret. Math., 1988
1987
The number of maximal independent sets in connected graphs.
J. Graph Theory, 1987
Exact solution of some Turán-type problems.
J. Comb. Theory A, 1987
The maximum number of balancing sets.
Graphs Comb., 1987
Bounding one-way differences.
Graphs Comb., 1987
On the kernel of intersecting families.
Graphs Comb., 1987
Computing the Volume is Difficulte.
Discret. Comput. Geom., 1987
1986
Extremal problems concerning Kneser graphs.
J. Comb. Theory B, 1986
Non-trivial intersecting families.
J. Comb. Theory A, 1986
The chromatic index of simple hypergraphs.
Graphs Comb., 1986
<i>t</i>-expansive and<i>t</i>-wise intersecting hypergraphs.
Graphs Comb., 1986
Colouring finite incidence structures.
Graphs Comb., 1986
Coloring graphs with locally few colors.
Discret. Math., 1986
Random Polytopes in the d-Dimensional Cube.
Discret. Comput. Geom., 1986
Families of finite sets with minimum shadows.
Comb., 1986
Finite projective spaces and intersecting hypergraphs.
Comb., 1986
Computing the Volume Is Difficult
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
1985
Forbidding Just One Intersection.
J. Comb. Theory A, 1985
A Ramsey-Sperner theorem.
Graphs Comb., 1985
Separating Pairs of Points by Standard Boxes.
Eur. J. Comb., 1985
Hypergraphs without a large star.
Discret. Math., 1985
Minimum matrix representation of closure operations.
Discret. Appl. Math., 1985
Set-systems with three intersections.
Comb., 1985
1984
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory A, 1984
Geometrical Solution of an Intersection Problem for Two Hypergraphs.
Eur. J. Comb., 1984
Union-free Hypergraphs and Probability Theory.
Eur. J. Comb., 1984
An exact result for 3-graphs.
Discret. Math., 1984
A new extremal property of Steiner triple-systems.
Discret. Math., 1984
Hypergraphs in which all disjoint pairs have distinct unions.
Comb., 1984
1983
Graphs without quadrilaterals.
J. Comb. Theory B, 1983
Mental Poker with Three or More Players
Inf. Control., 1983
On finite set-systems whose every intersection is a Kernel of a star.
Discret. Math., 1983
A new generation of the Erdös - Ko - Rado theorem.
Comb., 1983
1982
An Intersection Problem Whose Extremum Is the Finite Projective Space.
J. Comb. Theory A, 1982
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory A, 1982
Set-systems with prescribed cardinalities for pairwise intersections.
Discret. Math., 1982
1981
A short proof for a theorem of Harper about Hamming-spheres.
Discret. Math., 1981
The eigenvalues of random symmetric matrices.
Comb., 1981
Maximum degree and fractional matchings in uniform hypergraphs.
Comb., 1981
1980
The Erdös-Ko-Rado Theorem for Integer Sequences.
SIAM J. Algebraic Discret. Methods, 1980
On Maximal Intersecting Families of Finite Sets.
J. Comb. Theory A, 1980
On Automorphisms of Line-graphs.
Eur. J. Comb., 1980
