2024
Turán graphs with bounded matching number.
J. Comb. Theory B, March, 2024
Intersection theorems for (-1,0,1)-vectors.
Eur. J. Comb., March, 2024
Families with restricted matching number and multiply covered shadows.
Discret. Math., March, 2024
Four-vertex traces of finite sets.
Graphs Comb., February, 2024
On the Holroyd-Talbot conjecture for sparse graphs.
Discret. Math., January, 2024
Non-trivial t-intersecting separated families.
Discret. Appl. Math., January, 2024
Intersecting families without unique shadow.
Comb. Probab. Comput., January, 2024
J. Comb. Theory, Ser. A, 2024
Variations on the Bollobás set-pair theorem.
Eur. J. Comb., 2024
Improved bounds on the maximum diversity of intersecting families.
Eur. J. Comb., 2024
Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb., 2024
Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs.
Electron. J. Comb., 2024
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families.
Comb., 2024
2023
Some inequalities concerning cross-intersecting families of integer sequences.
Discret. Math., December, 2023
A product version of the Hilton-Milner theorem.
J. Comb. Theory A, November, 2023
Uniform intersecting families with large covering number.
Eur. J. Comb., October, 2023
SIAM J. Discret. Math., September, 2023
Intersections and distinct intersections in cross-intersecting families.
Eur. J. Comb., May, 2023
Perfect matchings in down-sets.
Discret. Math., May, 2023
Best possible bounds on the number of distinct differences in intersecting families.
Eur. J. Comb., 2023
2022
On Non-Empty Cross-Intersecting Families.
Comb., December, 2022
Exchange Properties of Finite Set-Systems.
SIAM J. Discret. Math., September, 2022
A Finite Set Intersection Theorem.
J. Multiple Valued Log. Soft Comput., 2022
The Erdős Matching Conjecture and concentration inequalities.
J. Comb. Theory B, 2022
On the maximum number of edges in hypergraphs with fixed matching and clique number.
Eur. J. Comb., 2022
On the sum of sizes of overlapping families.
Discret. Math., 2022
On the maximum number of distinct intersections in an intersecting family.
Discret. Math., 2022
Intersection Theorems for Triangles.
Discret. Comput. Geom., 2022
On Well-Connected Sets of Strings.
Electron. J. Comb., 2022
A Variant of the VC-Dimension with Applications to Depth-3 Circuits.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
How (Not) to Cut Your Cheese.
Am. Math. Mon., 2021
On strengthenings of the intersecting shadow theorem.
J. Comb. Theory A, 2021
Beyond the Erdős Matching Conjecture.
Eur. J. Comb., 2021
Old and new applications of Katona's circle.
Eur. J. Comb., 2021
Analogues of Milner's Theorem for families without long chains and of vector spaces.
Eur. J. Comb., 2021
On the size of shadow-added intersecting families.
Eur. J. Comb., 2021
Analogues of Katona's and Milner's theorems for two families.
Discret. Math., 2021
On the number of distinct differences in an intersecting family.
Discret. Math., 2021
Almost Intersecting Families.
Electron. J. Comb., 2021
2020
Maximum degree and diversity in intersecting hypergraphs.
J. Comb. Theory B, 2020
Extremal set theory for the binomial norm.
J. Comb. Theory A, 2020
Sharp results concerning disjoint cross-intersecting families.
Eur. J. Comb., 2020
An improved universal bound for t-intersecting families.
Eur. J. Comb., 2020
On non-trivial families without a perfect matching.
Eur. J. Comb., 2020
Mixed matchings in graphs.
Discret. Math., 2020
Families of finite sets satisfying intersection restrictions.
Discret. Appl. Math., 2020
Intersection theorems for (-1, 0, 1)-vectors.
CoRR, 2020
Maximal degrees in subgraphs of Kneser graphs.
CoRR, 2020
Erdős-Ko-Rado Theorem for a Restricted Universe.
Electron. J. Comb., 2020
2019
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman.
J. Comb. Theory B, 2019
Some exact results for multiply intersecting families.
J. Comb. Theory B, 2019
Families of sets with no matchings of sizes 3 and 4.
Eur. J. Comb., 2019
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families.
Comb. Probab. Comput., 2019
Simple juntas for shifted families.
CoRR, 2019
Incompatible Intersection Properties.
Comb., 2019
2018
An exact result for (0, ± 1)-vectors.
Optim. Lett., 2018
A stability theorem on cube tessellations.
J. Comput. Geom., 2018
New inequalities for families without <i>k</i> pairwise disjoint members.
J. Comb. Theory A, 2018
Erdős-Ko-Rado theorem for {0, ±1}-vectors.
J. Comb. Theory A, 2018
A degree version of the Hilton-Milner theorem.
J. Comb. Theory A, 2018
On families of sets without <i>k</i> pairwise disjoint members.
J. Comb. Theory B, 2018
Best possible bounds concerning the set-wise union of families.
Eur. J. Comb., 2018
Partition-free families of sets.
Discret. Math., 2018
Counting Intersecting and Pairs of Cross-Intersecting Families.
Comb. Probab. Comput., 2018
New inequalities for families without k pairwise disjoint members.
CoRR, 2018
Resilient Hypergraphs with Fixed Matching Number.
Comb., 2018
2017
Decomposition of a Cube into Nearly Equal Smaller Cubes.
Am. Math. Mon., 2017
Families with no s pairwise disjoint sets.
J. Lond. Math. Soc., 2017
A stability result for the Katona theorem.
J. Comb. Theory B, 2017
Families with no matchings of size s.
Electron. Notes Discret. Math., 2017
A size-sensitive inequality for cross-intersecting families.
Eur. J. Comb., 2017
A note on Huang-Zhao theorem on intersecting families with large minimum degree.
Discret. Math., 2017
A structural result for 3-graphs.
Discret. Math., 2017
On the maximum number of edges in a hypergraph with given matching number.
Discret. Appl. Math., 2017
Uniform s-Cross-Intersecting Families.
Comb. Probab. Comput., 2017
A Stability Result for Families with Fixed Diameter.
Comb. Probab. Comput., 2017
Partition-free families of sets.
CoRR, 2017
Families of vectors without antipodal pairs.
CoRR, 2017
2016
Invitation to intersection problems for finite sets.
J. Comb. Theory A, 2016
Intersection problems in the q-ary cube.
J. Comb. Theory A, 2016
Uniform eventown problems.
Eur. J. Comb., 2016
Multiply union families in N<sup>n</sup>.
Eur. J. Comb., 2016
A note on supersaturated set systems.
Eur. J. Comb., 2016
Linear independence, a unifying approach to shadow theorems.
Eur. J. Comb., 2016
Two problems of P. Erdős on matchings in set families.
CoRR, 2016
Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families.
CoRR, 2016
2014
An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory A, 2014
2013
The Katona theorem for vector spaces.
J. Comb. Theory A, 2013
Two-colorings with many monochromatic cliques in both colors.
J. Comb. Theory B, 2013
On the number of nonnegative sums.
J. Comb. Theory B, 2013
Improved bounds for Erdős' Matching Conjecture.
J. Comb. Theory A, 2013
Maximal independent sets in the covering graph of the cube.
Discret. Appl. Math., 2013
Some recent results on Ramsey-type numbers.
Discret. Appl. Math., 2013
2012
A new short proof of the EKR theorem.
J. Comb. Theory A, 2012
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory A, 2012
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Comb. Probab. Comput., 2012
On Matchings in Hypergraphs.
Electron. J. Comb., 2012
2011
Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb., 2011
On <i>r</i>-Cross Intersecting Families of Sets.
Comb. Probab. Comput., 2011
2010
A Hilton-Milner Theorem for Vector Spaces.
Electron. J. Comb., 2010
2009
A Note on Universal and Canonically Coloured Sequences.
Comb. Probab. Comput., 2009
2007
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory B, 2007
2006
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.
Graphs Comb., 2006
Weighted Non-Trivial Multiply Intersecting Families.
Comb., 2006
2005
Random walks and multiply intersecting families.
J. Comb. Theory A, 2005
2003
The game of <i>n</i>-times nim.
Discret. Math., 2003
2002
Extremal problems on set systems.
Random Struct. Algorithms, 2002
Weighted 3-Wise 2-Intersecting Families.
J. Comb. Theory A, 2002
2001
Set Systems with Restricted Intersections modulo Prime Powers.
J. Comb. Theory A, 2001
2000
Extremal k-edge-hamiltonian Hypergraphs.
Electron. Notes Discret. Math., 2000
1999
The Erdos-Ko-Rado Theorem for Integer Sequences.
Comb., 1999
1998
Some Inequalities Concerning Cross-Intersecting Families.
Comb. Probab. Comput., 1998
Uniform Intersecting Families with Covering Number Restrictions.
Comb. Probab. Comput., 1998
1996
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory A, 1996
Exponents of Uniform L-Systems.
J. Comb. Theory A, 1996
An Erdos-Ko-Rado Theorem for Direct Products.
Eur. J. Comb., 1996
1995
Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory A, 1995
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory A, 1995
On the section of a convex polyhedron.
Discret. Math., 1995
1994
Some best possible bounds concerning the traces of finite sets.
Graphs Comb., 1994
Density Results for Uniform Families.
Comb., 1994
1993
Reflecting a triangle in the plane.
Graphs Comb., 1993
Weight functions on the kneser graph and the solution of an intersection problem of Sali.
Comb., 1993
1992
Some Best Possible Inequalities Concerning Cross-Intersecting Families.
J. Comb. Theory A, 1992
The Uniformity Lemma for hypergraphs.
Graphs Comb., 1992
On cross-intersecting families.
Discret. Math., 1992
Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem.
Comb. Probab. Comput., 1992
The convex hull of antichains in posets.
Comb., 1992
Sharpening the LYM inequality.
Comb., 1992
1991
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory A, 1991
Multiply-intersecting families.
J. Comb. Theory B, 1991
A sharpening of Fisher's inequality.
Discret. Math., 1991
1990
Canonical Antichains on the Circle and Applications.
SIAM J. Discret. Math., 1990
Iterated combinatorial density theorems.
J. Comb. Theory A, 1990
Intersection theorems and mod <i>p</i> rank of inclusion matrices.
J. Comb. Theory A, 1990
Asymptotic solution of a turán-type problem.
Graphs Comb., 1990
Simplices with Given 2-Face Areas.
Eur. J. Comb., 1990
An intersection problem for codes.
Discret. Math., 1990
Binary codes and quasi-symmetric designs.
Discret. Math., 1990
1989
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory A, 1989
Helly-type Theorems for Varieties.
Eur. J. Comb., 1989
Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements.
Eur. J. Comb., 1989
A lower bound on the size of a complex generated by an antichain.
Discret. Math., 1989
1988
An extremal problem on <i>K<sub>r</sub></i>-free graphs.
J. Graph Theory, 1988
The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory B, 1988
The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory B, 1988
Quantitative theorems for regular systems of equations.
J. Comb. Theory A, 1988
On the Contact Dimensions of Graphs.
Discret. Comput. Geom., 1988
Some Ramsey - Turán type results for hypergraphs.
Comb., 1988
Intersection theorems in permutation groups.
Comb., 1988
1987
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory A, 1987
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory A, 1987
The Radon transform on Abelian Groups.
J. Comb. Theory A, 1987
Exact solution of some Turán-type problems.
J. Comb. Theory A, 1987
Erdös-Ko-Rado theorem with conditions on the maximal degree.
J. Comb. Theory A, 1987
A helly type theorem for hypersurfaces.
J. Comb. Theory A, 1987
Bounding one-way differences.
Graphs Comb., 1987
Codes with given distances.
Graphs Comb., 1987
The maximum number of edges in a 3-graph not containing a given star.
Graphs Comb., 1987
Open-interval graphs versus closed-interval graphs.
Discret. Math., 1987
Cops and robbers in graphs with large girth and Cayley graphs.
Discret. Appl. Math., 1987
On a pursuit game on Cazley graphs.
Comb., 1987
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.
Comb., 1987
1986
The Erdös-Ko-Rado theorem for vector spaces.
J. Comb. Theory A, 1986
Extremal problems concerning Kneser graphs.
J. Comb. Theory B, 1986
Non-trivial intersecting families.
J. Comb. Theory A, 1986
All rationals occur as exponents.
J. Comb. Theory A, 1986
Some intersection theorems for ordered sets and graphs.
J. Comb. Theory A, 1986
Large triangle-free subgraphs in graphs without<i>K</i><sub>4</sub>.
Graphs Comb., 1986
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.
Graphs Comb., 1986
Embedding the n-cube in Lower Dimensions.
Eur. J. Comb., 1986
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.
Eur. J. Comb., 1986
What must be contained in every oriented k-uniform hypergraph.
Discret. Math., 1986
Discret. Comput. Geom., 1986
Finite projective spaces and intersecting hypergraphs.
Comb., 1986
Orthogonal vectors in the n-dimensional cube and codes with missing distances.
Comb., 1986
Complexity classes in communication complexity theory (preliminary version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
On the chromatic number of the general Kneser-graph.
J. Graph Theory, 1985
On the size of graphs with complete-factors.
J. Graph Theory, 1985
Forbidding Just One Intersection.
J. Comb. Theory A, 1985
Lower bounds for Turán's problem.
Graphs Comb., 1985
The maximum number of disjoint pairs in a family of subsets.
Graphs Comb., 1985
Near Perfect Coverings in Graphs and Hypergraphs.
Eur. J. Comb., 1985
Polytopes Determined by Hypergraph Classes.
Eur. J. Comb., 1985
Intersection Theorems for Vector Spaces.
Eur. J. Comb., 1985
Good coverings of Hamming spaces with spheres.
Discret. Math., 1985
Extremal hypergraph problems and convex hulls.
Comb., 1985
Geometrical Realization of Set Systems and Probabilistic Communication Complexity
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory A, 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
A new short proof for the Kruskal-Katona theorem.
Discret. Math., 1984
Families of finite sets with three intersections.
Comb., 1984
On disjointly representable sets.
Comb., 1984
Intersecting Sperner families and their convex hulls.
Comb., 1984
1983
On the Trace of Finite Sets.
J. Comb. Theory A, 1983
Linear Dependencies among Subsets of a Finite Set.
Eur. J. Comb., 1983
On the Number of Sets in a Null t-Design.
Eur. J. Comb., 1983
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.
Eur. J. Comb., 1983
A probabilistic proof for the lym-inequality.
Discret. Math., 1983
A new generation of the Erdös - Ko - Rado theorem.
Comb., 1983
An extremal set theoretical characterization of some Steiner systems.
Comb., 1983
On Functions of Strenth t.
Comb., 1983
1982
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory A, 1982
An Extremal Problem for two Families of Sets.
Eur. J. Comb., 1982
On the vector space of 0-configurations.
Comb., 1982
1981
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex.
J. Comb. Theory A, 1981
A Finite Set Intersection Theorem.
Eur. J. Comb., 1981
On Large Vector Systems with Equal Scalar Products.
Eur. J. Comb., 1981
A short proof for a theorem of Harper about Hamming-spheres.
Discret. Math., 1981
Intersection theorems with geometric consequences.
Comb., 1981
Every large set of equidistant (0, +1, -1)-vectors forms a sunflower.
Comb., 1981
1980
The Erdös-Ko-Rado Theorem for Integer Sequences.
SIAM J. Algebraic Discret. Methods, 1980
Extremal Problems and Coverings of the Space.
Eur. J. Comb., 1980
On tilings of the binary vector space.
Discret. Math., 1980
On the maximum number of edges in a hypergraph whose linegraph contains no cycle.
Discret. Math., 1980
On the number of maximal dependencies in a data base relation of fixed order.
Discret. Math., 1980
1979
Families of finite sets satisfying a union condition.
Discret. Math., 1979
1978
On Intersecting Families of Finite Sets.
J. Comb. Theory A, 1978
1977
On the Maximum Number of Permutations with Given Maximal or Minimal Distance.
J. Comb. Theory A, 1977
On the Minimum Number of Disjoint Pairs in a Family of Finite Sets.
J. Comb. Theory A, 1977
1976
On Sperner Families Satisfying an Additional Condition.
J. Comb. Theory A, 1976
1975
The Proof of a Conjecture of G. O. H. Katona.
J. Comb. Theory A, 1975
