On extremal problems of graphs and generalized graphs
From MaRDI portal
Publication:2394998
DOI10.1007/BF02759942zbMath0129.39905OpenAlexW2110354774WikidataQ97694235 ScholiaQ97694235MaRDI QIDQ2394998
Publication date: 1964
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02759942
Related Items
Density and covering properties of intervals of ℝ n , Multidimensional van der Corput and sublevel set estimates, Distance Ramsey numbers, Hypergraphs with no tight cycles, Extremal problems on set systems, Sparse Rademacher chaos in symmetric spaces, On the number of halving planes, Codegree problems for projective geometries, Co-degree density of hypergraphs, Additive approximation for edge-deletion problems, On induced Ramsey numbers fork-uniform hypergraphs, Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$, Nearly Equal Distances in the Plane, Point Selections and Weak ε-Nets for Convex Hulls, Simplicial homeomorphs and trace-bounded hypergraphs, On the hat guessing number of a planar graph class, Hypergraph Turán densities can have arbitrarily large algebraic degree, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Nearly \(k\)-distance sets, List Ramsey numbers, High powers of Hamiltonian cycles in randomly augmented graphs, Multicolor list Ramsey numbers grow exponentially, Applying extremal graph theory to a question on finite groups, Bipartite Turán problems for ordered graphs, Extremal numbers for cycles in a hypercube, Balanced supersaturation for some degenerate hypergraphs, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Inverting the Turán problem, Making an H $H$‐free graph k $k$‐colorable, Minimum degree and the graph removal lemma, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Non-jumping numbers for 5-uniform hypergraphs, Ramsey non-goodness involving books, Uniform Turán density of cycles, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, F$F$‐factors in Quasi‐random Hypergraphs, Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}, On a topological version of Pach's overlap theorem, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Random multilinear maps and the Erd\H{o}s box problem, Dirac-type conditions for spanning bounded-degree hypertrees, The minimum degree removal lemma thresholds, Restricted problems in extremal combinatorics, Unavoidable order-size pairs in hypergraphs -- positive forcing density, Combinatorial Structures on van der Waerden sets, Tiling multipartite hypergraphs in quasi-random hypergraphs, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Hypergraphs with vanishing Turán density in uniformly dense hypergraphs, Multicolor Ramsey numbers for triple systems, Triangles in graphs without bipartite suspensions, Stability theorems for some Kruskal-Katona type results, Exact Minimum Codegree Threshold for K−4-Factors, On the co-degree threshold for the Fano plane, On Tight Cycles in Hypergraphs, GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS, The Complexity of Perfect Packings in Dense Graphs, Efficient Testing without Efficient Regularity, On crown-free families of subsets, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Covering and tiling hypergraphs with tight cycles, Induced Turán Numbers, Zarankiewicz’s problem for semilinear hypergraphs, Relative Turán Problems for Uniform Hypergraphs, Forbidding complete hypergraphs as traces, Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs, Hypergraph Ramsey numbers, Unnamed Item, Some extremal problems in geometry, Testing subgraphs in directed graphs, Some extremal problems in geometry, Many \(T\) copies in \(H\)-free graphs, On the multiplicative representation of integers, Anticoncentration for subgraph statistics, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Generalized Ramsey numbers: forbidding paths with few colors, A hypergraph blow-up lemma, On some extremal problems on \(r\)-graphs, Minimum number of edges that occur in odd cycles, Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs, On \(n\)-dependence, On the existence of triangulated spheres in 3-graphs, and related problems, A hypergraph extension of Turán's theorem, \(F\)-factors in hypergraphs via absorption, Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs, Tiling 3-Uniform Hypergraphs With K43−2e, Complete Partite subgraphs in dense hypergraphs, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs, Spanning surfaces in \(3\)-graphs, On the Zarankiewicz problem for intersection hypergraphs, Regular subgraphs of uniform hypergraphs, Forbidden induced subposets of given height, On the toric ideals of matroids of a fixed rank, Repeated angles in \(E_ 4\), A note on non-jumping numbers for \(r\)-uniform hypergraphs, On substructure densities of hypergraphs, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, Short proofs of some extremal results. II., Some extremal results on hypergraph Turán problems, Turán problems and shadows. II: Trees, Small cores in 3-uniform hypergraphs, Some Ramsey-Turán type results for hypergraphs, Exact solution of some Turán-type problems, Extremal results for random discrete structures, A note on the jumping constant conjecture of Erdős, Hypergraphs do not jump, Non-jumping numbers for 4-uniform hypergraphs, Using Lagrangians of hypergraphs to find non-jumping numbers. II., Some extremal results on complete degenerate hypergraphs, A hypergraph Turán theorem via Lagrangians of intersecting families, Uniform hypergraphs containing no grids, New bounds for the distance Ramsey number, The maximal length of a gap between \(r\)-graph Turán densities, Note on upper density of quasi-random hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Turán numbers of extensions, Perfect matchings in 3-partite 3-uniform hypergraphs, Covering and tiling hypergraphs with tight cycles, Unavoidable tournaments, Perfect matchings in 4-uniform hypergraphs, Some applications of Ramsey's theorem to additive number theory, Finding unavoidable colorful patterns in multicolored graphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Combinatorial complexity bounds for arrangements of curves and spheres, Powers of Hamilton cycles in tournaments, High-order degree and combined degree in complex networks, On possible Turán densities, 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 problems on non-uniform hypergraphs, Turán problems and shadows. I: Paths and cycles, A note on the structure of Turán densities of hypergraphs, Forbidden configurations and product constructions, On disjoint concave chains in arrangements of (pseudo) lines, Boolean algebras and Lubell functions, Comparable pairs in families of sets, Turán number of special four cycles in triple systems, Generating non-jumping numbers recursively, 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, A separation theorem in property testing, Squarefree polynomials with prescribed coefficients, Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom, The typical structure of graphs with no large cliques, Pach's selection theorem does not admit a topological extension, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, On multiaspect graphs, Forbidden Berge hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, Analytic methods for uniform hypergraphs, Turán numbers for Berge-hypergraphs and related extremal problems, Vertex Turán problems in the hypercube, New lower bounds for Ramsey numbers of graphs and hypergraphs, On jumping densities of hypergraphs, On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property, The number of graphs with large forbidden subgraphs, Développements recents de la théorie des graphes, Erdős-Hajnal-type theorems in hypergraphs, Asymptotic solution of a Turán-type problem, Zarankiewicz's problem for semi-algebraic hypergraphs, On graphs which contain all small trees, The complexity of perfect matchings and packings in dense hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Tournament quasirandomness from local counting, On Hamiltonian cycles in hypergraphs with dense link graphs, On an extremal hypergraph problem related to combinatorial batch codes, A universal exponent for homeomorphs, Degenerate Turán densities of sparse hypergraphs, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, The number of graphs without forbidden subgraphs, Powers of Hamiltonian cycles in multipartite graphs, 2-factors with \(k\) cycles in Hamiltonian graphs, The vertex Turán density in 3-ary \(n\)-cubes, On non-strong jumping numbers and density structures of hypergraphs, Complete \(r\)-partite subgraphs of dense \(r\)-graphs, On Ramsey - Turan type theorems for hypergraphs, Large antipodal families, Supersaturated graphs and hypergraphs, On subgraphs of tripartite graphs, Non-jumping Turán densities of hypergraphs, Geometric and o-minimal Littlewood-Offord problems, Extremal problems whose solutions are the blowups of the small Witt- designs, Distinct distances determined by subsets of a point set in space, An application of graph theory to additive number theory, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis, A linear hypergraph extension of Turán's theorem, On the algebraic and topological structure of the set of Turán densities
Cites Work
