Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
A Characterization of Easily Testable Induced Subgraphs
Noga Alon
*
,
Asaf Shapira
*
Corresponding author for this work
School of Computer Science
School of Mathematical Sciences
Research output
:
Contribution to conference
›
Paper
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Characterization of Easily Testable Induced Subgraphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Query Complexity
100%
One-sided Error
100%
Error Properties
100%
H-free
100%
Induced Subgraph
100%
Directed Graph
50%
Probabilistic Arguments
50%
Additive number Theory
50%
Graph-theoretic
50%
First Author
50%
Combinatorial Graph
50%
Fast-growing Functions
50%
Mathematics
Polynomial
100%
Query Complexity
100%
Induced Subgraph
100%
Edge
50%
Additive Number Theory
50%