On extremal problems of graphs and generalized graphs

1964/09/01 by P. Erdös · 64 citations
Mathematics · #Finite Group Theory Research #Limits and Structures in Graph Theory #Graph theory and applications

paper · doi:10.1007/bf02759942

Cited by

• Testing subgraphs in directed graphs
• The number of regular simplices in higher dimensions
• Rational exponents near 3/2
• Bounds and Limitations on Codes Achieving List Recovery Capacity
• Venn diagrams as forbidden hypergraph traces
• On Zarankiewicz's bounds for valued vector spaces
• An alternative proof of the upper bound for the generalised Erdős box problem
• Turán number of bipartite graphs with no K_t,t
• Comparable pairs in families of sets
• The codegree Turán density of tight cycles
• Complete r-partite subgraphs of dense r-graphs
• Turán numbers of extensions
• Tiling multipartite hypergraphs in Quasi-random Hypergraphs
• On the Hypergraph Nash-Williams' Conjecture
• Relative Turán densities for ordered graphs: all and nothing
• Codegree conditions for tiling complete k-partite k-graphs and loose cycles
• Hamiltonicity in randomly perturbed hypergraphs
• Daisies and Other Turan Problems
• Turan Problems and Shadows I: Paths and Cycles
• Turán number of special four cycles in triple systems
• On crown-free families of subsets
• Optimal and Efficient Partite Decompositions of Hypergraphs
• Non-jumps of hypergraphs
• Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
• Cover 3-uniform hypergraphs by vertex-disjoint tight paths
• Repeated Angles inE 4
• F-factors in Quasi-random Hypergraphs
• Shadows of ordered graphs
• A Tverberg-type problem of Kalai: Two negative answers to questions of Alon and Smorodinsky, and the power of disjointness
• Tight bounds towards Zarankiewicz problem in hypergraph
• Extremal constructions for apex partite hypergraphs
• A Note on Turán Numbers and the Erdős-Stone-Simonovits Theorem
• Spectral Turán-type problems for the α-spectral radius of hypergraphs with degree stability
• Making an H-Free Graph k-Colorable
• The number of graphs with large forbidden subgraphs
• Representation Complexity of Semi-algebraic Graphs
• Inverting the Turán Problem
• H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
• Polynomial Property Testing
• On Sidorenko exponents of hypergraphs
• Additive approximation for edge-deletion problems
• Turán problems for simplicial complexes
• Finding Partite Hypergraphs Efficiently
• The maximum number of triangles in K_1,s,t-free graphs
• Zarankiewicz's problem for semi-algebraic hypergraphs
• F-factors in hypergraphs via absorption
• The complexity of perfect matchings and packings in dense hypergraphs
• Extremal Problems on Generalized Directed Hypergraphs
• Some extremal results on hypergraph Turán problems
• The maximal length of a gap between r-graph Turán densities
• Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs
• Perfect Matchings in 4-uniform hypergraphs
• On tight cycles in hypergraphs
• On the co-degree threshold for the Fano plane
• Some extremal results on complete degenerate hypergraphs
• A simple proof of a (p,2)-theorem for non-piercing regions
• Hypergraphs without complete partite subgraphs
• Turán density of tight cycles minus one edge in the ℓ₂-norm
• Two Erd\Hos--Hajnal-type Theorems in Hypergraphs
• Hypergraph Ramsey numbers
• Nearly k -Distance Sets. [europepmc]
• The growth rate of multicolor Ramsey numbers of 3-graphs. [europepmc]
• Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences. [europepmc]
• On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers. [europepmc]