Regularity partitions and the topology of graphons
From MaRDI portal
Publication:3078210
zbMath1242.05188arXiv1002.4377MaRDI QIDQ3078210
Publication date: 18 February 2011
Full work available at URL: https://arxiv.org/abs/1002.4377
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Structure and regularity for subsets of groups with finite VC-dimension, NOTES ON THE STABLE REGULARITY LEMMA, A semi-algebraic version of Zarankiewicz's problem, A classification of orbits admitting a unique invariant measure, Strongly polynomial sequences as interpretations, Nondegenerate spheres in four dimensions, Efficient Removal Lemmas for Matrices, Impartial digraphs, Decomposition of tournament limits, Efficient removal lemmas for matrices, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, From quasirandom graphs to graph limits and graphlets, The removal lemma for tournaments, Minimum degree and the graph removal lemma, Graph limits and hereditary properties, First-order limits, an analytical perspective, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, On the Descriptive Power of Probability Logic, Interval graph limits, Limits of kernel operators and the spectral regularity lemma, Regular partitions of gentle graphs, The automorphism group of a graphon, Identifiability for Graphexes and the Weak Kernel Metric, Regularity lemmas for stable graphs, Compact graphings, Limits of structures and the example of tree semi-lattices, Finitely forcible graphons, Matching polytons, Vapnik-Chervonenkis density in some theories without the independence property, I, Asymptotic Structure for the Clique Density Theorem, EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES, The Cut Metric for Probability Distributions, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Compactness and finite forcibility of graphons, Quantitative structure of stable sets in arbitrary finite groups, DOMINATION AND REGULARITY, Cycles of a given length in tournaments, Linear embeddings of graphs and graph limits
