29 citations · 72 across the 26 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Induced and non-induced forbidden subposet problems
Balazs Patkos
The problem of determining the maximum size that a -free subposet of the Boolean lattice can have, attracted the attention of many researchers, but little is kno…
math.CO2014
Identifying codes and searching with balls in graphs
Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3
Given a graph and a positive integer we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…
math.CO2014
Supersaturation and stability for forbidden subposet problems
Balazs Patkos
We address a supersaturation problem in the context of forbidden subposets. A family of sets is said to contain the poset if there is an injection $i:P \rightarro…