scientific article; zbMATH DE number 3641497
From MaRDI portal
Publication:4200109
zbMath0413.05055MaRDI QIDQ4200109
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Triangles in randomly perturbed graphs, On the size-Ramsey number of grid graphs, On the Erdős–Sós conjecture for trees with bounded degree, Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree, Removal lemmas and approximate homomorphisms, On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem, Stability for the Erdős-Rothschild problem, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Diagonal Ramsey via effective quasirandomness, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, On 3‐graphs with no four vertices spanning exactly two edges, Approximating sparse graphs: The random overlapping communities model, Tower-type bounds for Roth's theorem with popular differences, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, High powers of Hamiltonian cycles in randomly augmented graphs, Graph limits: An alternative approach to s‐graphons, Upper tail of the spectral radius of sparse Erdös-Rényi graphs, On sufficient conditions for spanning structures in dense graphs, Hypergraph regularity and random sampling, New upper bounds for Ramsey numbers of books, Monochromatic connected matchings in 2‐edge‐colored multipartite graphs, Ramsey numbers of large books, Ramsey non-goodness involving books, Continuous stable regularity, The Ramsey numbers of squares of paths and cycles, Ramsey numbers of large even cycles and fans, An improvement on Łuczak's connected matchings method, Minimum degree conditions for tight Hamilton cycles, Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime, On some Multicolor Ramsey Properties of Random Graphs, Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL, An improved lower bound for arithmetic regularity, A Ramsey–Turán theory for tilings in graphs, Some Cubic Time Regularity Algorithms for Triple Systems, Extended commonality of paths and cycles via Schur convexity, Graph and hypergraph packing, Restricted problems in extremal combinatorics, Local-vs-global combinatorics, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, Random bipartite Ramsey numbers of long cycles, An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions, The (7, 4)-Conjecture in Finite Groups, Path Ramsey Number for Random Graphs, Tuza's Conjecture is Asymptotically Tight for Dense Graphs, On Regularity Lemmas and their Algorithmic Applications, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Regularity lemmas in a Banach space setting, An approximate version of the Loebl-Komlós-Sós conjecture, Induced Ramsey-type theorems, Parent-identifying codes, Crossing patterns of segments, Minimum rainbow \(H\)-decompositions of graphs, Minimum rainbow \(H\)-decompositions of graphs, A note on permutation regularity, Testing subgraphs in directed graphs, The tripartite Ramsey number for trees, Dense flag triangulations of 3-manifolds via extremal graph theory, Structural Properties of Sparse Graphs, Ramsey Numbers Involving Large Books, Large Book-Cycle Ramsey Numbers, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs, Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles, The regularity method for graphs with few 4‐cycles, Additive approximation of generalized Turán questions, On universality of graphs with uniformly distributed edges, Szemerédi's regularity lemma via martingales, Small complete minors above the extremal edge density, On a degree sequence analogue of Pósa's conjecture, Counting in hypergraphs via regularity inheritance, Ramsey numbers of squares of paths, Regular slices for hypergraphs, Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles, Short proofs of some extremal results. II., A variant of the hypergraph removal lemma, Small subsets inherit sparse \(\varepsilon\)-regularity, Monochromatic cycle partitions of graphs with large minimum degree, Combinatorial theorems in sparse random sets, An Ore-type theorem on Hamiltonian square cycles, Packing directed cycles efficiently, More results on Ramsey-Turán type problems, On the density of a graph and its blowup, Turán's theorem for pseudo-random graphs, Color the cycles, The Ramsey number for a triple of long even cycles, Improved monochromatic loose cycle partitions in hypergraphs, Maximum planar subgraphs in dense graphs, On an anti-Ramsey threshold for random graphs, From quasirandom graphs to graph limits and graphlets, Turán numbers of bipartite graphs plus an odd cycle, Some extremal problems for hereditary properties of graphs, Measurable events indexed by words, Hamiltonian cycles with all small even chords, Loebl-Komlós-Sós conjecture: dense case, The quantitative behaviour of polynomial orbits on nilmanifolds, Approximate multipartite version of the Hajnal-Szemerédi theorem, A concentration inequality for product spaces, Minimum \(H\)-decompositions of graphs: edge-critical case, The structure of almost all graphs in a hereditary property, Sparse partition universal graphs for graphs of bounded degree, Matrix and discrepancy view of generalized random and quasirandom graphs, A new proof of the graph removal lemma, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, Induced saturation number, The large deviation principle for the Erdős-Rényi random graph, Limits of kernel operators and the spectral regularity lemma, Combinatorial and computational aspects of graph packing and graph decomposition, Hamilton cycles in dense vertex-transitive graphs, A counterexample to sparse removal, Packing edge-disjoint triangles in regular and almost regular tournaments, On the KŁR conjecture in random graphs, On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite, The maximum edit distance from hereditary graph properties, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Deterministic vs non-deterministic graph property testing, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Note on Enomoto and Ota's conjecture for short paths in large graphs, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Hardness and algorithms for rainbow connection, Improved bounds on the multicolor Ramsey numbers of paths and even cycles, On embedding well-separable graphs, Quadripartite version of the Hajnal-Szemerédi theorem, Note on the 3-graph counting Lemma, Monochromatic bounded degree subgraph partitions, Making a \(K_4\)-free graph bipartite, Partitioning random graphs into monochromatic components, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, On 2-factors with \(k\) components, A short proof of Gowers' lower bound for the regularity lemma, Almost \(H\)-factors in dense graphs, Tight cycles and regular slices in dense hypergraphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, The critical window for the classical Ramsey-Turán problem, On the Hamiltonicity of triple systems with high minimum degree, Cycle-connected graphs, How to avoid using the regularity Lemma: Pósa's conjecture revisited, Every minor-closed property of sparse graphs is testable, A conjecture of Erdős on graph Ramsey numbers, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, Weak hypergraph regularity and linear hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, On the multi-colored Ramsey numbers of paths and even cycles, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Hereditary properties of hypergraphs, A combinatorial proof of the removal lemma for groups, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, The 3-colored Ramsey number of even cycles, Bandwidth theorem for random graphs, Locating any two vertices on Hamiltonian cycles in large graphs, On the cover Ramsey number of Berge hypergraphs, Vertex-disjoint claws in graphs, Cycle factors in dense graphs, Highly connected coloured subgraphs via the regularity Lemma, Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs, Optimal factorizations of families of trees, The Ramsey number of a graph with bounded maximum degree, The Erdős-Ko-Rado theorem for small families, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs, A degree sequence Hajnal-Szemerédi theorem, Relating multiway discrepancy and singular values of nonnegative rectangular matrices, The Ramsey number for hypergraph cycles. I., Popular progression differences in vector spaces II, NOTES ON THE STABLE REGULARITY LEMMA, Ramsey properties of algebraic graphs and hypergraphs, Minimum Degrees for Powers of Paths and Cycles, Nonlinear large deviations, Quasi-Random Set Systems, Regularity lemmas for hypergraphs and quasi-randomness, Large Rainbow Cliques in Randomly Perturbed Dense Graphs, Dirac-type results for tilings and coverings in ordered graphs, Fractional and integer matchings in uniform hypergraphs, Minimum \(H\)-decompositions of graphs, On model selection for dense stochastic block models, Additive approximation for edge-deletion problems, Random graphs with monochromatic triangles in every edge coloring, Large monochromatic components in edge colored graphs with a minimum degree condition, Stability for vertex cycle covers, On the Interplay Between Strong Regularity and Graph Densification, Limits of discrete distributions and Gibbs measures on random graphs, On graphs with a large number of edge-colorings avoiding a rainbow triangle, On odd rainbow cycles in edge-colored graphs, Efficient Removal Lemmas for Matrices, Asymptotic multipartite version of the Alon-Yuster theorem, Local resilience for squares of almost spanning cycles in sparse random graphs, The Ramsey-Turán problem for cliques, Constructive Packings of Triple Systems, Harnessing the Bethe free energy, The removal lemma for tournaments, Embedding spanning subgraphs of small bandwidth, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, A Rainbow Erdös--Rothschild Problem, Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities, Replica symmetry breaking without replicas, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, On Degree Sequences Forcing The Square of a Hamilton Cycle, Unnamed Item, Hamilton decompositions of regular expanders: applications, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth, Maximum and Minimum Degree Conditions for Embedding Trees, Amplification and Derandomization without Slowdown, A Rainbow Dirac's Theorem, Sparse Hypergraphs with Applications to Coding Theory, Extremal results in sparse pseudorandom graphs, The bandwidth theorem for locally dense graphs, Efficient Testing without Efficient Regularity, Multiple recurrence in quasirandom groups, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A Local Approach to the Erdös--Sós Conjecture, Unexpected upper bounds on the complexity of some communication games, FORCING QUASIRANDOMNESS WITH TRIANGLES, A blow-up lemma for approximate decompositions, A sparse regular approximation lemma, A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem, Testing of matrix-poset properties, An analytic approach to sparse hypergraphs: hypergraph removal, A variant of the Corners theorem, An extremal problem onKr-free graphs, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Almost given length cycles in digraphs, Green’s Conjecture and Testing Linear Invariant Properties, Short paths in quasi-random triple systems with sparse underlying graphs, Reconstruction of Kauffman networks applying trees, A note on the Size-Ramsey number of long subdivisions of graphs, Unnamed Item, Earthmover Resilience and Testing in Ordered Structures, A hypergraph regularity method for generalized Turán problems, Decompositions of Triangle-Dense Graphs, Roth-type theorems in finite groups, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, Regularity properties for triple systems, Rainbow Erdös--Rothschild Problem for the Fano Plane, Generalized quasirandom properties of expanding graph sequences, Tilings in Randomly Perturbed Dense Graphs, Vertex Ramsey properties of randomly perturbed graphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, A fast new algorithm for weak graph regularity, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, The Induced Removal Lemma in Sparse Graphs, An introduction to large deviations for random graphs, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Spanning Trees with Few Branch Vertices, Degree Conditions for Embedding Trees, Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs, On the structure of Dense graphs with bounded clique number, Sprinkling a Few Random Edges Doubles the Power, Dirac's Condition for Spanning Halin Subgraphs, A Degree Sequence Komlós Theorem, A note on counting orientations, On an anti-Ramsey property of random graphs, Monochromatic trees in random tournaments, Estimating parameters associated with monotone properties, Ramsey properties of randomly perturbed graphs: cliques and cycles, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, A discrepancy version of the Hajnal–Szemerédi theorem, Poset limits can be totally ordered, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Independent sets in hypergraphs, Embedding Graphs Having Ore-Degree at Most Five, Packing Triangles in Regular Tournaments, A Ramsey variant of the Brown–Erdős–Sós conjecture, Structure and regularity for subsets of groups with finite VC-dimension, Cut distance identifying graphon parameters over weak* limits, Improved monochromatic double stars in edge colorings, Ramsey numbers of fans and large books, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Clique decompositions of multipartite graphs and completion of Latin squares, Ramsey properties of random graphs and folkman numbers, Additive combinatorics and graph theory, Proof of an entropy conjecture of Leighton and Moitra, Lower bounds for the smallest singular value of structured random matrices, Testing graphs against an unknown distribution, Tilings in vertex ordered graphs, Remarks on an edge-coloring problem, Spanning trees of dense directed graphs, Strong edge colorings of uniform graphs, A characterization of easily testable induced digraphs and \(k\)-colored graphs, Edge-colorings avoiding a fixed matching with a prescribed color pattern, Monochromatic cycle power partitions, Large monochromatic components and long monochromatic cycles in random hypergraphs, Accumulation points of the edit distance function, Regularity-based spectral clustering and mapping the Fiedler-carpet, Distributing pairs of vertices on Hamiltonian cycles, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Large deviation for uniform graphs with given degrees, 2-factors in dense graphs, On \(K^ 4\)-free subgraphs of random graphs, A Tverberg-type result on multicolored simplices, Efficient removal lemmas for matrices, Long monochromatic paths and cycles in 2-colored bipartite graphs, A skew version of the Loebl-Komlós-Sós conjecture, A degree sequence version of the Kühn-Osthus tiling theorem, On multipartite Hajnal-Szemerédi theorems, The Schur-Erdős problem for semi-algebraic colorings, Proof mining and effective bounds in differential polynomial rings, Average Gromov hyperbolicity and the Parisi ansatz, Exact Ramsey numbers of odd cycles via nonlinear optimisation, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, Regular partitions of gentle graphs, On a tiling conjecture of Komlós for 3-chromatic graphs., Measure concentration and the weak Pinsker property, Bipartite Ramsey numbers of paths for random graphs, Szemerédi's proof of Szemerédi's theorem, Colorings with only rainbow arithmetic progressions, Hyperfinite graphings and combinatorial optimization, Limitations on regularity lemmas for clustering graphs, Minimum degree conditions for monochromatic cycle partitioning, Sparse hypergraphs: new bounds and constructions, Turán and Ramsey numbers in linear triple systems, The domination number of the graph defined by two levels of the \(n\)-cube. II, Degree sum and graph linkage with prescribed path lengths, Bethe states of random factor graphs, On the cover Turán number of Berge hypergraphs, Extremal problems and results related to Gallai-colorings, Graph summarization with quality guarantees, Sparse multipartite graphs as partition universal for graphs with bounded degree, Linear dependence between hereditary quasirandomness conditions, A weighted regularity lemma with applications, Bipartite Ramsey numbers for graphs of small bandwidth, Tiling tripartite graphs with 3-colorable graphs: the extreme case, Enomoto and Ota's conjecture holds for large graphs, The role of topology in large deviations, \(K_r\)-factors in graphs with low independence number, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Ramsey-goodness -- and otherwise, Some sharp results on the generalized Turán numbers, Percolation on dense graph sequences, Regularity lemmas for clustering graphs, \(p\)-arrangeable graphs are Folkman linear, The Ramsey numbers for a triple of long cycles, Ramsey numbers of large books and bipartite graphs with small bandwidth, An extension of the rainbow Erdős-Rothschild problem, Tournament quasirandomness from local counting, On the relation of separability, bandwidth and embedding, Hypergraphs without exponents, Bipartite Ramsey numbers of cycles for random graphs, Matchings with few colors in colored complete graphs and hypergraphs, Degenerate Turán densities of sparse hypergraphs, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Measures on the square as sparse graph limits, Optimal graphon estimation in cut distance, Monochromatic square-cycle and square-path partitions, Small rainbow cliques in randomly perturbed dense graphs, A sharp threshold phenomenon in string graphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, The number of graphs without forbidden subgraphs, Bounding the strong chromatic index of dense random graphs, Powers of Hamiltonian cycles in multipartite graphs, Multicolour bipartite Ramsey number of paths, Approximating the rectilinear crossing number, Ramsey numbers for sparse graphs, A tight bound for hypergraph regularity, Turán and Ramsey numbers in linear triple systems. II, The speed of hereditary properties of graphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, A new bound for the Brown-Erdős-Sós problem, Ramsey numbers for bipartite graphs with small bandwidth, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Phase transitions in Ramsey-Turán theory, Almost-spanning subgraphs with bounded degree in dense graphs, Star-critical Ramsey numbers involving large books
