Pages that link to "Item:Q5917574"

The following pages link to Testing subgraphs in directed graphs (Q5917574):

Displaying 43 items.

• A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
• Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
• A survey on Hamilton cycles in directed graphs (Q412269) (← links)
• Hierarchy theorems for property testing (Q430844) (← links)
• A new proof of the graph removal lemma (Q640795) (← links)
• An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
• Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
• Unavoidable tournaments (Q895998) (← links)
• Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
• Cycles of given length in oriented graphs (Q965252) (← links)
• Hamiltonian degree sequences in digraphs (Q974465) (← links)
• A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
• Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
• Lower bounds for the smallest singular value of structured random matrices (Q1621447) (← links)
• Bounds for graph regularity and removal lemmas (Q1930904) (← links)
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles (Q1989954) (← links)
• Tournament quasirandomness from local counting (Q2036620) (← links)
• Packing and covering directed triangles asymptotically (Q2065998) (← links)
• Spanning trees of dense directed graphs (Q2132400) (← links)
• A characterization of easily testable induced digraphs and \(k\)-colored graphs (Q2136197) (← links)
• Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
• Hierarchy theorems for testing properties in size-oblivious query complexity (Q2281254) (← links)
• Lower bounds for testing triangle-freeness in Boolean functions (Q2353187) (← links)
• The removal lemma for tournaments (Q2421551) (← links)
• Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
• (Q2857428) (← links)
• The Erdös-Hajnal Conjecture-A Survey (Q2874098) (← links)
• Dependent random choice (Q3068761) (← links)
• Introduction to Testing Graph Properties (Q3088198) (← links)
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (Q3529511) (← links)
• On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
• Directed Graphs Without Short Cycles (Q3557536) (← links)
• An analytic approach to sparse hypergraphs: hypergraph removal (Q4645028) (← links)
• Introduction to Testing Graph Properties (Q4933365) (← links)
• Green’s Conjecture and Testing Linear Invariant Properties (Q4933388) (← links)
• Monochromatic trees in random tournaments (Q4993096) (← links)
• (Q5002633) (← links)
• (Q5009551) (← links)
• Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
• On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• Packing and Covering a Given Directed Graph in a Directed Graph (Q6146269) (← links)
• On Multicolor Ramsey Numbers of Triple System Paths of Length 3 (Q6170440) (← links)