On extremal problems of graphs and generalized graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- On non-strong jumping numbers and density structures of hypergraphs
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- Large antipodal families
- An extremal problem for sets with applications to graph theory
- An application of graph theory to additive number theory
- Repeated angles in \(E_ 4\)
- Some Ramsey-Turán type results for hypergraphs
- Exact solution of some Turán-type problems
- Hypergraphs do not jump
- Some applications of Ramsey's theorem to additive number theory
- On disjoint concave chains in arrangements of (pseudo) lines
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
- Développements recents de la théorie des graphes
- On graphs which contain all small trees
- Forbidden induced subposets of given height
- A note on non-jumping numbers for \(r\)-uniform hypergraphs
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- Turán numbers of extensions
- Covering and tiling hypergraphs with tight cycles
- High-order degree and combined degree in complex networks
- Extremal problems on components and loops in graphs
- Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- Squarefree polynomials with prescribed coefficients
- Hamilton cycles in hypergraphs below the Dirac threshold
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- The number of graphs without forbidden subgraphs
- On Ramsey - Turan type theorems for hypergraphs
- Pach's selection theorem does not admit a topological extension
- Turán numbers for Berge-hypergraphs and related extremal problems
- Tournament quasirandomness from local counting
- On Hamiltonian cycles in hypergraphs with dense link graphs
- A universal exponent for homeomorphs
- Powers of Hamiltonian cycles in multipartite graphs
- The vertex Turán density in 3-ary \(n\)-cubes
- On subgraphs of tripartite graphs
- Non-jumping Turán densities of hypergraphs
- Geometric and o-minimal Littlewood-Offord problems
- A linear hypergraph extension of Turán's theorem
- Spanning surfaces in \(3\)-graphs
- Some extremal results on hypergraph Turán problems
- Finding unavoidable colorful patterns in multicolored graphs
- Fooling views: a new lower bound technique for distributed computations under congestion
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Two Erdős-Hajnal-type theorems in hypergraphs
- Turán number of special four cycles in triple systems
- Analytic methods for uniform hypergraphs
- Asymptotic solution of a Turán-type problem
- The complexity of perfect matchings and packings in dense hypergraphs
- Degenerate Turán densities of sparse hypergraphs
- Generalized Ramsey numbers: forbidding paths with few colors
- Minimum number of edges that occur in odd cycles
- On n-dependence
- \(F\)-factors in hypergraphs via absorption
- Distance Ramsey numbers
- Codegree problems for projective geometries
- Additive approximation for edge-deletion problems
- Inverting the Turán problem
- Non-jumping numbers for 5-uniform hypergraphs
- Multicolor Ramsey numbers for triple systems
- On the co-degree threshold for the Fano plane
- On crown-free families of subsets
- Forbidding complete hypergraphs as traces
- On the multiplicative representation of integers
- On some extremal problems on r-graphs
- On a valence problem in extremal graph theory
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the algebraic and topological structure of the set of Turán densities
- A hypergraph extension of Turán's theorem
- On the number of halving planes
- Co-degree density of hypergraphs
- On the hat guessing number of a planar graph class
- Applying extremal graph theory to a question on finite groups
- Bipartite Turán problems for ordered graphs
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Triangles in graphs without bipartite suspensions
- Stability theorems for some Kruskal-Katona type results
- On the Zarankiewicz problem for intersection hypergraphs
- Regular subgraphs of uniform hypergraphs
- Tight co-degree condition for packing of loose cycles in 3-graphs
- On extremal graphs with bounded girth
- Tiling 3-uniform hypergraphs with K₄^3-2e
- The constructions and the judgement algorithms about G-extremal graphs and G-near-extremal graphs
- Selected Topics in the Extremal Graph Theory
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- The complexity of perfect packings in dense graphs
- A hypergraph blow-up lemma
- Complete partite subgraphs in dense hypergraphs
- Sparse Rademacher chaos in symmetric spaces
- On an extremal inverse problem in graph theory
- Short proofs of some extremal results. II.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Turán problems and shadows. II: Trees
- Small cores in 3-uniform hypergraphs
- On induced Ramsey numbers for \(k\)-uniform hypergraphs
- scientific article; zbMATH DE number 4145688 (Why is no real title available?)
- Extremal results for random discrete structures
- Hypergraph Ramsey numbers
- A hypergraph Turán theorem via Lagrangians of intersecting families
This page was built for publication: On extremal problems of graphs and generalized graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394998)
