Supersaturated graphs and hypergraphs
From MaRDI portal
Publication:787158
DOI10.1007/BF02579292zbMATH Open0529.05027DBLPjournals/combinatorica/ErdosS83OpenAlexW2115730400WikidataQ97694620 ScholiaQ97694620MaRDI QIDQ787158FDOQ787158
Authors: Miklós Simonovits, P. Erdős 
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579292
Recommendations
- Supersaturated sparse graphs and hypergraphs
- scientific article; zbMATH DE number 3900799
- On the super domination number of graphs
- scientific article
- Supereulerian graphs: A survey
- Publication:4731211
- Super domination in graphs
- Supersaturation for subgraph counts
- Super-pancyclic hypergraphs and bipartite graphs
- Super dominating sets in graphs
Cites Work
- On extremal problems of graphs and generalized graphs
- On some extremal problems on \(r\)-graphs
- On the structure of linear graphs
- Compactness results in extremal graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On complete subgraphs of different orders
- On the Structure of Edge Graphs II
Cited In (only showing first 100 items - show all)
- Relative Turán Problems for Uniform Hypergraphs
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Extremal problems concerning Kneser-graphs
- On the Chromatic Thresholds of Hypergraphs
- Supersaturation for subgraph counts
- On the decomposition of random hypergraphs
- Super-pancyclic hypergraphs and bipartite graphs
- Flag algebras
- The number of the maximal triangle-free graphs
- Unavoidable tournaments
- Supersaturation for hereditary properties
- Testing subgraphs in directed graphs
- Independent sets in hypergraphs
- A fractional Helly theorem for convex lattice sets
- Combinatorial theorems in sparse random sets
- Extremal results for random discrete structures
- A geometric theory for hypergraph matching
- Hypergraph containers
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- On some graph densities in locally dense graphs
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- On the Extremal Number of Subdivisions
- Forbidding complete hypergraphs as traces
- On set systems with a threshold property
- Extremal problems whose solutions are the blowups of the small Witt- designs
- On the Minimal Density of Triangles in Graphs
- Turán problems on non-uniform hypergraphs
- Title not available (Why is that?)
- Supersaturation for Ramsey-Turán problems
- Turánnical hypergraphs
- Some Ramsey-Turán type results for hypergraphs
- A hypergraph extension of Turán's theorem
- An improved error term for minimum \(H\)-decompositions of graphs
- Exact solution of some Turán-type problems
- Complete partite subgraphs in dense hypergraphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Sharp thresholds for certain Ramsey properties of random graphs
- \(F\)-factors in hypergraphs via absorption
- Online containers for hypergraphs, with applications to linear equations
- Simple Containers for Simple Hypergraphs
- Tverberg’s theorem is 50 years old: A survey
- The co-degree density of the Fano plane
- Co-degree density of hypergraphs
- Some Turán type results on the hypercube
- A new proof of the graph removal lemma
- The SAT-UNSAT transition for random constraint satisfaction problems
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods
- Dense flag triangulations of 3-manifolds via extremal graph theory
- Constructions of non-principal families in extremal hypergraph theory
- Exact Minimum Codegree Threshold for K−4-Factors
- On the Turán density of uniform hypergraphs
- Stability results for random discrete structures
- Multiplicities of subgraphs
- A note on superbrittle graphs
- On the number of monotone sequences
- Supersaturation and stability for forbidden subposet problems.
- On the KŁR conjecture in random graphs
- Decompositions into subgraphs of small diameter
- Non-uniform Turán-type problems
- A reverse Sidorenko inequality
- The complexity of vertex coloring problems in uniform hypergraphs with high degree
- Turán and Ramsey properties of subcube intersection graphs
- Generating all subsets of a finite set with disjoint unions
- Title not available (Why is that?)
- Snarks, hypohamiltonian graphs and non-supereulerian graphs
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Constructing designs straightforwardly: Worst arising cases
- Title not available (Why is that?)
- The number of additive triples in subsets of abelian groups
- On the number of halving planes
- The maximum number of disjoint pairs in a family of subsets
- The Chromatic Number of Kneser Hypergraphs
- Point Selections and Weak ε-Nets for Convex Hulls
- Turán number of generalized triangles
- An exact Turán result for the generalized triangle
- Berge's theorem, fractional Helly, and art galleries
- Intersection patterns of planar sets
- Finitely forcible graphons
- Counting hypergraphs with large girth
- Some sharp results on the generalized Turán numbers
- Pairs of SAT-assignments in random Boolean formulæ
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sidorenko's conjecture for blow-ups
- Extremal Graph Theory and Face Numbers of Flag Triangulations of Manifolds
- Spanning surfaces in \(3\)-graphs
- Impartial digraphs
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas
- Factors in randomly perturbed hypergraphs
- Estimating parameters associated with monotone properties
- Multicolor Turán numbers
- Cut distance identifying graphon parameters over weak* limits
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
- Sharp thresholds for constraint satisfaction problems and homomorphisms
- Supersaturation problem for the bowtie
- Supersaturation of even linear cycles in linear hypergraphs
- The Turán number of blow-ups of trees
- High powers of Hamiltonian cycles in randomly augmented graphs
- Minimum degree and the graph removal lemma
This page was built for publication: Supersaturated graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787158)
