Saturation problems with regularity constraints | 0 | 0.34 | 2022 |
Generalized Turán Problems for Complete Bipartite Graphs | 0 | 0.34 | 2022 |
Hypergraph Based Berge Hypergraphs | 0 | 0.34 | 2022 |
Some exact results for generalized Turan problems | 0 | 0.34 | 2022 |
Unified approach to the generalized Turan problem and supersaturation | 0 | 0.34 | 2022 |
Supersaturation, Counting, And Randomness In Forbidden Subposet Problems | 0 | 0.34 | 2021 |
Hypergraphs without exponents | 0 | 0.34 | 2021 |
Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets | 0 | 0.34 | 2021 |
A Note On The Turan Number Of A Berge Odd Cycle | 0 | 0.34 | 2021 |
$t$-Wise Berge and $t$-Heavy Hypergraphs | 0 | 0.34 | 2020 |
On clique coverings of complete multipartite graphs | 0 | 0.34 | 2020 |
Set systems related to a house allocation problem | 0 | 0.34 | 2020 |
Generalized Turán problems for even cycles | 3 | 0.44 | 2020 |
General lemmas for Berge–Turán hypergraph problems | 2 | 0.42 | 2020 |
Counting copies of a fixed subgraph in $F$-free graphs | 1 | 0.36 | 2019 |
Linearity of saturation for Berge hypergraphs. | 0 | 0.34 | 2019 |
On the Number of Containments in P-free Families. | 0 | 0.34 | 2019 |
Asymptotics for the Turán number of Berge-. | 1 | 0.36 | 2019 |
Asymptotics for the Turán number of Berge-K2, | 1 | 0.36 | 2019 |
On the Weight of Berge-F-Free Hypergraphs. | 0 | 0.34 | 2019 |
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. | 0 | 0.34 | 2019 |
Majority problems of large query size | 0 | 0.34 | 2019 |
Stability results for vertex Turatn problems in Kneser graphs | 0 | 0.34 | 2019 |
Generalized Turán problems for disjoint copies of graphs | 4 | 0.48 | 2019 |
On the Number of Cycles in a Graph with Restricted Cycle Lengths. | 2 | 0.42 | 2018 |
Line Percolation in Finite Projective Planes. | 0 | 0.34 | 2018 |
Identifying defective sets using queries of small size. | 0 | 0.34 | 2018 |
Forbidden Subposet Problems for Traces of Set Families. | 0 | 0.34 | 2018 |
Smart elements in combinatorial group testing problems. | 0 | 0.34 | 2018 |
Intersecting P-free families. | 0 | 0.34 | 2017 |
Extremal Results for Berge Hypergraphs. | 1 | 0.36 | 2017 |
A plurality problem with three colors and query size three. | 1 | 0.36 | 2017 |
Conscious and controlling elements in combinatorial group testing problems. | 0 | 0.34 | 2017 |
Finding a non-minority ball with majority answers. | 2 | 0.39 | 2017 |
Topological orderings of weighted directed acyclic graphs | 0 | 0.34 | 2016 |
A note on tilted Sperner families with patterns | 0 | 0.34 | 2016 |
Finding a majority ball with majority answers. | 0 | 0.34 | 2015 |
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. | 0 | 0.34 | 2015 |
Edge-decomposition of Graphs into Copies of a Tree with Four Edges. | 10 | 1.01 | 2014 |
Separating families of convex sets | 2 | 0.46 | 2013 |
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets | 0 | 0.34 | 2013 |
Advantage in the discrete Voronoi game. | 0 | 0.34 | 2013 |
Density-Based group testing | 1 | 0.36 | 2013 |
Profile polytopes of some classes of families. | 1 | 0.40 | 2013 |
The Magnus-Derek game in groups. | 0 | 0.34 | 2013 |
Saturating Sperner Families | 2 | 0.52 | 2013 |
Majority and plurality problems | 0 | 0.34 | 2012 |
Search for the end of a path in the d-dimensional grid and in other graphs | 0 | 0.34 | 2012 |
Almost Intersecting Families of Sets. | 3 | 0.50 | 2012 |
Generalizations of the tree packing conjecture. | 3 | 0.57 | 2012 |