Testing properties of graphs and functions
From MaRDI portal
Publication:607829
DOI10.1007/s11856-010-0060-7zbMath1246.05106arXiv0803.1248OpenAlexW2076664242WikidataQ105583495 ScholiaQ105583495MaRDI QIDQ607829
Publication date: 6 December 2010
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.1248
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Finitely forcible graph limits are universal, Testing graphs against an unknown distribution, First order convergence of matroids, Densities in large permutations and parameter testing, From quasirandom graphs to graph limits and graphlets, On a question of Vera T. Sós about size forcing of graphons, Graphon convergence of random cographs, Limits of multi-relational graphs, First-Order Convergence and Roots, Estimating and understanding exponential random graph models, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, Finitely forcible graphons with an almost arbitrary structure, Limits of kernel operators and the spectral regularity lemma, Finitely forcible graphons and permutons, Tilings in graphons, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Deterministic vs non-deterministic graph property testing, Sparse halves in dense triangle-free graphs, Non-Deterministic Graph Property Testing, On derivatives of graphon parameters, Testing permutation properties through subpermutations, Earthmover Resilience and Testing in Ordered Structures, Quasi-random words and limits of word sequences, Minimizing the number of 5-cycles in graphs with given edge-density, First order limits of sparse graphs: Plane trees and path-width, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Weak regularity and finitely forcible graph limits, The Cut Metric for Probability Distributions, Compactness and finite forcibility of graphons, Differential calculus on graphon space
Cites Work
- Unnamed Item
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- A combinatorial characterization of the testable graph properties
- Graph limits and parameter testing
- Property testing and its connection to learning and approximation
- What is the furthest graph from a hereditary property?
- Testing versus estimation of graph properties
