Easy testability for posets

Panna Tímea Fekete, Gábor Kun

Type: Preprint

Publication Date: 2023-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2302.11390

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	A polynomial removal lemma for posets	2023	Gábor Kun Panna Tímea Fekete
+	The complexity of testing all properties of planar graphs, and the role of isomorphism	2021	Sabyasachi Basu Akash Kumar C. Seshadhri
+	Testing perfection is hard	2011	Noga Alon Jacob Fox
+ PDF Chat	Every monotone graph property is testable	2005	Noga Alon A. Shapira
+	A CHARACTERIZATION OF TESTABLE GRAPH PROPERTIES IN THE DENSE GRAPH MODEL	2023	FELIPE DE OLIVEIRA
+ PDF Chat	The complexity of testing all properties of planar graphs, and the role of isomorphism	2022	Sabyasachi Basu Akash Kumar C. Seshadhri
+	Testing Forest-Isomorphism in the Adjacency List Model	2014	Mitsuru Kusumoto Yuichi Yoshida
+ PDF Chat	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs	2007	Ilan Alon Eldar Fischer Ilan Newman
+	Property testing and parameter estimation	2020	Henrique Stagni
+ PDF Chat	Counting small induced subgraphs with hereditary properties	2022	Jacob Focke Marc Roth
+	Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness	2019	Julian Dörfler Marc Roth Johannes Schmitt Philip Wellnitz
+ PDF Chat	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels	2014	Bart M. P. Jansen Dániel Marx
+	Counting Small Induced Subgraphs Satisfying Monotone Properties	2020	Marc Roth Johannes Schmitt Philip Wellnitz
+ PDF Chat	Counting Small Induced Subgraphs: Hardness via Fourier Analysis	2025	Radu Curticapean Daniel Neuen
+	A combinatorial characterization of the testable graph properties	2006	Noga Alon Eldar Fischer Ilan Newman A. Shapira
+ PDF Chat	Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness	2020	Marc Roth Johannes Schmitt
+ PDF Chat	Answering Related Questions	2025	Édouard Bonnet
+	Induced and non-induced poset saturation problems	2021	Balázs Keszegh Nathan Lemons Ryan R. Martin Dömötör Pálvölgyi Balázs Patkós
+	Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels	2014	Bart M. P. Jansen Dániel Marx
+	Towards Testing Monotonicity of Distributions Over General Posets	2019	Maryam Aliakbarpour Themis Gouleakis John Peebles Ronitt Rubinfeld Anak Yodpinyanee

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (15)

Action	Title	Year	Authors
+ PDF Chat	Hereditary properties of permutations are strongly testable	2013	Tereza Klimošová Daniel Kráľ
+	Generalizations of the removal lemma	2009	Vojtěch Rödl Mathias Schacht
+	On Sets of Integers Which Contain No Three Terms in Arithmetical Progression	1946	Felix Behrend
+ PDF Chat	A removal lemma for systems of linear equations over finite fields	2011	Daniel Kráľ Oriol Serra Lluís Vena
+ PDF Chat	Every locally characterized affine-invariant property is testable	2013	Arnab Bhattacharyya Eldar Fischer Hamed Hatami Pooya Hatami Shachar Lovett
+	Poset limits can be totally ordered	2015	Jan Hladký András Máthé Viresh Patel Oleg Pikhurko
+	Testing properties of graphs and functions	2008	László Lovász Balázs Szegedy
+ PDF Chat	A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing	2016	Jacob Fox János Pach Andrew Suk
+ PDF Chat	Fast Property Testing and Metrics for Permutations	2018	Jacob Fox Fan Wei
+	Efficient Testing of Large Graphs	2000	Noga Alon Eldar Fischer Michael Krivelevich Márió Szegedy