Recommendations
- Supersaturated sparse graphs and hypergraphs
- scientific article; zbMATH DE number 3900799
- On the super domination number of graphs
- scientific article; zbMATH DE number 5762364
- 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
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- Compactness results in extremal graph theory
- On complete subgraphs of different orders
- On extremal problems of graphs and generalized graphs
- On some extremal problems on r-graphs
- On the Structure of Edge Graphs II
- On the structure of linear graphs
Cited in
(only showing first 100 items - show all)- Exact minimum codegree threshold for \(K^-_4\)-factors
- Supersaturated sparse graphs and hypergraphs
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY
- On non-degenerate Berge-Turán problems
- Counting hypergraphs with large girth
- Extremal problems concerning Kneser-graphs
- The exact minimum number of triangles in graphs with given order and size
- Ordered graphs and large bi-cliques in intersection graphs of curves
- On the decomposition of random hypergraphs
- Supersaturation for subgraph counts
- On the Chromatic Thresholds of Hypergraphs
- Super-pancyclic hypergraphs and bipartite graphs
- Flag algebras
- Unavoidable tournaments
- Some sharp results on the generalized Turán numbers
- Supersaturation for hereditary properties
- The number of the maximal triangle-free graphs
- Pairs of SAT-assignments in random Boolean formulæ
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sidorenko's conjecture for blow-ups
- A fractional Helly theorem for convex lattice sets
- Combinatorial theorems in sparse random sets
- Extremal results for random discrete structures
- Testing subgraphs in directed graphs
- Independent sets in hypergraphs
- Spanning surfaces in \(3\)-graphs
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Impartial digraphs
- Hypergraph containers
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- A geometric theory for hypergraph matching
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- Multicolor Turán numbers
- Cut distance identifying graphon parameters over weak* limits
- Forbidding complete hypergraphs as traces
- On set systems with a threshold property
- Estimating parameters associated with monotone properties
- On some graph densities in locally dense graphs
- Factors in randomly perturbed hypergraphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Turán problems on non-uniform hypergraphs
- Sharp thresholds for constraint satisfaction problems and homomorphisms
- On the Minimal Density of Triangles in Graphs
- scientific article; zbMATH DE number 3900799 (Why is no real title available?)
- Supersaturation for Ramsey-Turán problems
- Some Ramsey-Turán type results for hypergraphs
- The Turán number of blow-ups of trees
- Supersaturation of even linear cycles in linear hypergraphs
- Turánnical hypergraphs
- A hypergraph extension of Turán's theorem
- The codegree threshold for 3-graphs with independent neighborhoods
- Relative Turán problems for uniform hypergraphs
- High powers of Hamiltonian cycles in randomly augmented graphs
- Minimum degree and the graph removal lemma
- List Ramsey numbers
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- An improved error term for minimum H-decompositions of graphs
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Exact solution of some Turán-type problems
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Nearly \(k\)-distance sets
- Complete partite subgraphs in dense hypergraphs
- \(F\)-factors in hypergraphs via absorption
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
- Online containers for hypergraphs, with applications to linear equations
- On supersaturation and stability for generalized Turán problems
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Sharp thresholds for certain Ramsey properties of random graphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- Convex graphon parameters and graph norms
- scientific article; zbMATH DE number 426325 (Why is no real title available?)
- A lower bound for families of Natarajan dimension \(d\)
- Geometrical sets with forbidden configurations
- Tverberg’s theorem is 50 years old: A survey
- The co-degree density of the Fano plane
- Some Turán type results on the hypercube
- Co-degree density of hypergraphs
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- A new proof of the graph removal lemma
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- The SAT-UNSAT transition for random constraint satisfaction problems
- Unified approach to the generalized Turán problem and supersaturation
- Balanced supersaturation for some degenerate hypergraphs
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Dense flag triangulations of 3-manifolds via extremal graph theory
- Strong forms of stability from flag algebra calculations
- On the extremal number of subdivisions
- Unavoidable order-size pairs in hypergraphs -- positive forcing density
- Constructions of non-principal families in extremal hypergraph theory
- A note on the \(k\)-colored crossing ratio of dense geometric graphs
- Supersaturation in posets and applications involving the container method
- On the Turán density of uniform hypergraphs
- Multiplicities of subgraphs
- Superextensions and the depth of median graphs
- Stability results for random discrete structures
- A note on superbrittle graphs
- On the number of monotone sequences
- Supersaturation and stability for forbidden subposet problems.
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)