Easy testability for posets

zbMatharXiv:2302.11390MaRDI QIDQ6508919

Panna Tímea Fekete, Gábor Kun

Publication date: 1 January 1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Easy testability for posets