Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
From MaRDI portal
Recommendations
Cited in
(34)- Bounds for graph regularity and removal lemmas
- Structure and regularity for subsets of groups with finite VC-dimension
- Nondegenerate spheres in four dimensions
- Efficient removal lemmas for matrices
- Regular partitions of gentle graphs
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- The removal lemma for tournaments
- Testing of matrix-poset properties
- The entropy of random-free graphons and properties
- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects
- scientific article; zbMATH DE number 1775414 (Why is no real title available?)
- Testing subgraphs in large graphs
- Algorithmic Aspects of Property Testing in the Dense Graphs Model
- On finite sets of small tripling or small alternation in arbitrary groups
- Efficient testing without efficient regularity
- Quantitative structure of stable sets in arbitrary finite groups
- Efficient removal lemmas for matrices
- Ramsey properties of algebraic graphs and hypergraphs
- Earthmover Resilience and Testing in Ordered Structures
- scientific article; zbMATH DE number 6469238 (Why is no real title available?)
- Large homogeneous submatrices
- DOMINATION AND REGULARITY
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Minimum degree and the graph removal lemma
- Local-vs-global combinatorics
- The structure of almost all graphs in a hereditary property
- Regular decomposition of the edge set of a graph with applications
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
- The VC dimension of quadratic residues in finite fields
- Polynomial removal lemma for ordered matchings
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
- Is it easy to regularize a hypergraph with easy links?
- Induced subgraph density. VI: Bounded VC-dimension
- Property testing of the Boolean and binary rank
This page was built for publication: Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507528)
