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)- Directed graphs with lower orientation Ramsey thresholds
- On the KŁR conjecture in random graphs
- A reverse Sidorenko inequality
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Non-uniform Turán-type problems
- Generating all subsets of a finite set with disjoint unions
- The complexity of vertex coloring problems in uniform hypergraphs with high degree
- Decompositions into subgraphs of small diameter
- More on rainbow cliques in edge-colored graphs
- Turán problems for mixed graphs
- Turán and Ramsey properties of subcube intersection graphs
- Snarks, hypohamiltonian graphs and non-supereulerian graphs
- Extremal graph theory and face numbers of flag triangulations of manifolds
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- Constructing designs straightforwardly: Worst arising cases
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- scientific article; zbMATH DE number 3885945 (Why is no real title available?)
- Ramsey non-goodness involving books
- The maximum number of disjoint pairs in a family of subsets
- Simple containers for simple hypergraphs
- On the number of halving planes
- Supergraphs and the cubic Leigh-Strassler model
- The number of additive triples in subsets of abelian groups
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- The Chromatic Number of Kneser Hypergraphs
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
- Paths of given length in tournaments
- Some exact results for non-degenerate generalized Turán problems
- Turán number of generalized triangles
- Point Selections and Weak ε-Nets for Convex Hulls
- An exact Turán result for the generalized triangle
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- Berge's theorem, fractional Helly, and art galleries
- Intersection patterns of planar sets
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- Finitely forcible graphons
- Extremal results on feedback arc sets in digraphs
- Nerves, minors, and piercing numbers
- 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
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)
