scientific article; zbMATH DE number 3609704
From MaRDI portal
Publication:4175585
zbMath0393.05031MaRDI QIDQ4175585
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ The length of an s-increasing sequence of r-tuples ⋮ Removal lemmas and approximate homomorphisms ⋮ Polynomial removal lemmas for ordered graphs ⋮ Simple analysis of graph tests for linearity and PCP ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Unnamed Item ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ ⋮ Mantel's theorem for random graphs ⋮ The number of the maximal triangle-free graphs ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Efficient Removal Lemmas for Matrices ⋮ Testing Linear-Invariant Properties ⋮ Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Generalized Turán results for intersecting cliques ⋮ Hypergraph regularity and random sampling ⋮ Counting hypergraphs with large girth ⋮ Minimum degree and the graph removal lemma ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Extremal independent set reconfiguration ⋮ Book free 3-uniform hypergraphs ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ The minimum degree removal lemma thresholds ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ Local-vs-global combinatorics ⋮ Additive structure in convex translates ⋮ Easily Testable Graph Properties ⋮ The (7, 4)-Conjecture in Finite Groups ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Counting configuration-free sets in groups ⋮ Efficient Testing without Efficient Regularity ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A sparse regular approximation lemma ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On the structure of pointsets with many collinear triples ⋮ Polynomial removal lemma for ordered matchings ⋮ Kneser graphs are like Swiss cheese ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ A variant of the Corners theorem ⋮ Constructing dense grid-free linear $3$-graphs ⋮ Green’s Conjecture and Testing Linear Invariant Properties ⋮ Unnamed Item ⋮ On regularity lemma and barriers in streaming and dynamic matching ⋮ Testability and repair of hereditary hypergraph properties ⋮ On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ What is good mathematics? ⋮ Growth rate of the number of empty triangles in the plane ⋮ Regular decomposition of the edge set of a graph with applications ⋮ A new proof of Roth’s theorem on arithmetic progressions ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Triforce and corners ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\) ⋮ On multicolor Turán numbers ⋮ Turán numbers of \(r\)-graphs on \(r + 1\) vertices ⋮ Abundance: asymmetric graph removal lemmas and integer solutions to linear equations ⋮ Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles ⋮ Stability from graph symmetrization arguments in generalized Turán problems ⋮ Caps and wickets ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Large girth approximate Steiner triple systems ⋮ Asymptotic Structure for the Clique Density Theorem ⋮ The Induced Removal Lemma in Sparse Graphs ⋮ Unnamed Item ⋮ Triple systems with no three triples spanning at most five points ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Estimating parameters associated with monotone properties ⋮ A note on the Brown–Erdős–Sós conjecture in groups ⋮ Independent sets in hypergraphs ⋮ New Results on Linear Size Distance Preservers ⋮ Unnamed Item ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture ⋮ The regularity method for graphs with few 4‐cycles ⋮ The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ The exact linear Turán number of the sail ⋮ Additive combinatorics and graph theory ⋮ Testing graphs against an unknown distribution ⋮ On subsets of abelian groups with no 3-term arithmetic progression ⋮ A characterization of easily testable induced digraphs and \(k\)-colored graphs ⋮ On ordered Ramsey numbers of bounded-degree graphs ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Induced arithmetic removal: complexity 1 patterns over finite fields ⋮ Multicolor Turán numbers ⋮ Short proofs of some extremal results. II. ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ A variant of the hypergraph removal lemma ⋮ Small cores in 3-uniform hypergraphs ⋮ Exact solution of some Turán-type problems ⋮ The linear Turán number of small triple systems or why is the wicket interesting?
This page was built for publication:
