Supersaturated graphs and hypergraphs
From MaRDI portal
Publication:787158
DOI10.1007/BF02579292zbMath0529.05027DBLPjournals/combinatorica/ErdosS83OpenAlexW2115730400WikidataQ97694620 ScholiaQ97694620MaRDI QIDQ787158
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579292
Related Items (only showing first 100 items - show all)
Spanning surfaces in \(3\)-graphs ⋮ Cut distance identifying graphon parameters over weak* limits ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Unnamed Item ⋮ Multicolor Turán numbers ⋮ On the number of halving planes ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Co-degree density of hypergraphs ⋮ On the Extremal Number of Subdivisions ⋮ On set systems with a threshold property ⋮ Extremal Graph Theory and Face Numbers of Flag Triangulations of Manifolds ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ The number of the maximal triangle-free graphs ⋮ Turán number of generalized triangles ⋮ Some Ramsey-Turán type results for hypergraphs ⋮ Point Selections and Weak ε-Nets for Convex Hulls ⋮ Exact solution of some Turán-type problems ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ Multiplicities of subgraphs ⋮ Impartial digraphs ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ Supersaturation in posets and applications involving the container method ⋮ The Turán number of blow-ups of trees ⋮ Sidorenko's conjecture for blow-ups ⋮ Unavoidable tournaments ⋮ Supersaturation for hereditary properties ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Intersection patterns of planar sets ⋮ The number of additive triples in subsets of abelian groups ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Berge's theorem, fractional Helly, and art galleries ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Simple Containers for Simple Hypergraphs ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ A new proof of the graph removal lemma ⋮ Generating all subsets of a finite set with disjoint unions ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ On the Minimal Density of Triangles in Graphs ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Nerves, minors, and piercing numbers ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ Strong forms of stability from flag algebra calculations ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ Turán problems on non-uniform hypergraphs ⋮ On the KŁR conjecture in random graphs ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ On the number of monotone sequences ⋮ Constructions of non-principal families in extremal hypergraph theory ⋮ Hypergraph containers ⋮ Turán and Ramsey Properties of Subcube Intersection Graphs ⋮ Turánnical hypergraphs ⋮ An exact Turán result for the generalized triangle ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ Decompositions into Subgraphs of Small Diameter ⋮ On the decomposition of random hypergraphs ⋮ Forbidding complete hypergraphs as traces ⋮ Stability results for random discrete structures ⋮ Pairs of SAT-assignments in random Boolean formulæ ⋮ Sharp thresholds for certain Ramsey properties of random graphs ⋮ Non-uniform Turán-type problems ⋮ Some sharp results on the generalized Turán numbers ⋮ A lower bound for families of Natarajan dimension \(d\) ⋮ The Chromatic Number of Kneser Hypergraphs ⋮ Finitely forcible graphons ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Supersaturation problem for the bowtie ⋮ The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree ⋮ Flag algebras ⋮ Sharp thresholds for constraint satisfaction problems and homomorphisms ⋮ Testing subgraphs in directed graphs ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ Convex graphon parameters and graph norms ⋮ An improved error term for minimum \(H\)-decompositions of graphs ⋮ The SAT-UNSAT transition for random constraint satisfaction problems ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Ordered graphs and large bi-cliques in intersection graphs of curves ⋮ Estimating parameters associated with monotone properties ⋮ Dense flag triangulations of 3-manifolds via extremal graph theory ⋮ A geometric theory for hypergraph matching ⋮ Some Turán type results on the hypercube ⋮ A reverse Sidorenko inequality ⋮ Independent sets in hypergraphs ⋮ The co-degree density of the Fano plane ⋮ Extremal problems concerning Kneser-graphs ⋮ The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas ⋮ A hypergraph extension of Turán's theorem ⋮ A sharp threshold for the renameable-Horn and the \(q\)-Horn properties ⋮ \(F\)-factors in hypergraphs via absorption ⋮ The maximum number of disjoint pairs in a family of subsets ⋮ Extremal problems whose solutions are the blowups of the small Witt- designs ⋮ Complete Partite subgraphs in dense hypergraphs ⋮ A fractional Helly theorem for convex lattice sets
Cites Work
This page was built for publication: Supersaturated graphs and hypergraphs
