Pages that link to "Item:Q4842123"

The following pages link to A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (Q4842123):

Displaying 40 items.

• Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations (Q473025) (← links)
• Monochromatic bounded degree subgraph partitions (Q501026) (← links)
• Additive approximation of generalized Turán questions (Q832525) (← links)
• Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs (Q1045170) (← links)
• Ramsey properties of random hypergraphs (Q1380335) (← links)
• Ramsey numbers for sparse graphs (Q1584253) (← links)
• Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
• Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
• Bounds for graph regularity and removal lemmas (Q1930904) (← links)
• Resolution of the Oberwolfach problem (Q2039583) (← links)
• Ramsey numbers of books and quasirandomness (Q2095106) (← links)
• Optimal packings of bounded degree trees (Q2279501) (← links)
• Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
• Short paths in quasi-random triple systems with sparse underlying graphs (Q2496208) (← links)
• A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
• A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds (Q2988852) (← links)
• A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (Q3088120) (← links)
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
• On edge‐ordered Ramsey numbers (Q3386532) (← links)
• Regular pairs in sparse random graphs I (Q4419289) (← links)
• A blow-up lemma for approximate decompositions (Q4633567) (← links)
• A sparse regular approximation lemma (Q4633762) (← links)
• On characterizing hypergraph regularity (Q4798170) (← links)
• Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
• Estimating parameters associated with monotone properties (Q4993108) (← links)
• Minimalist designs (Q5120741) (← links)
• Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
• A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
• On random sampling in uniform hypergraphs (Q5198663) (← links)
• A fast new algorithm for weak graph regularity (Q5222555) (← links)
• The Induced Removal Lemma in Sparse Graphs (Q5222577) (← links)
• An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions (Q5364234) (← links)
• On Regularity Lemmas and their Algorithmic Applications (Q5366957) (← links)
• Maximum dispersion problem in dense graphs (Q5929139) (← links)
• Partitioning problems in dense hypergraphs (Q5957354) (← links)
• Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
• On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
• Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)
• A note on the \(k\)-colored crossing ratio of dense geometric graphs (Q6639374) (← links)