scientific article; zbMATH DE number 3041944

zbMATH Open0026.26903MaRDI QIDQ5781249FDOQ5781249

Pál Turán

Publication date: 1941

Title of this publication is not available (Why is that?)

zbMATH Keywords

Topology

Cited In (only showing first 100 items - show all)

• Relative Turán Problems for Uniform Hypergraphs
• On a valence problem in extremal graph theory
• On finite simple groups and Kneser graphs.
• An upper bound for the Turán number \(t_3(n,4)\)
• On the codegree density of complete 3-graphs and related problems
• A maximum degree theorem for diameter-2-critical graphs
• A note on Turán numbers for even wheels
• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
• The clique number and the smallest \(Q\)-eigenvalue of graphs
• New bounds on the signed total domination number of graphs
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• Combinatorial theorems in sparse random sets
• Extremal results for random discrete structures
• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• Embedding partial triple systems
• Global aspects of the space of 6D \(\mathcal{N} = 1\) supergravities
• The maximum edit distance from hereditary graph properties
• On graph-Lagrangians of hypergraphs containing dense subgraphs
• On Lagrangians of \(r\)-uniform hypergraphs
• An extremal graph problem
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Making a \(K_4\)-free graph bipartite
• Linear hash families and forbidden configurations
• Lower bounds on the stability number of graphs computed in terms of degrees
• On the Turán number of some ordered even cycles
• A linear hypergraph extension of Turán's theorem
• Some extremal results on hypergraph Turán problems
• On a conjecture of Erdős and Simonovits: even cycles
• Saturated \(r\)-uniform hypergraphs
• On the Turán number of forests
• Turán problems on non-uniform hypergraphs
• On the eccentric distance sum of graphs
• The maximal length of a gap between \(r\)-graph Turán densities
• Rainbow generalizations of Ramsey theory: A survey
• Uniquely tree-saturated graphs
• Compression of finite-state automata through failure transitions
• Rainbow numbers for graphs containing small cycles
• Degree condition and \(Z_3\)-connectivity
• Local resilience of graphs
• Ore-condition and \(Z_3\)-connectivity
• The number of \(K_{m,m}\)-free graphs
• Triangle-free four-chromatic graphs
• The codegree threshold of \(K_4^-\)
• Cliques in graphs excluding a complete graph minor
• Exact solution of some Turán-type problems
• Embeddings of partial Steiner triple systems
• Maximum induced trees in graphs
• On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
• Streaming algorithms for independent sets in sparse hypergraphs
• Topological designs
• Estimating and understanding exponential random graph models
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
• Asymptotic Structure for the Clique Density Theorem
• On some extremal problems on \(r\)-graphs
• Co-degree density of hypergraphs
• The clique density theorem
• The early evolution of the \(H\)-free process
• A Motzkin-Straus type result for 3-uniform hypergraphs
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• The number of graphs without forbidden subgraphs
• Uniquely \(C _{4}\)-saturated graphs
• Fractional Helly theorem for Cartesian products of convex sets
• Some results on Lagrangians of hypergraphs
• Pairwise generating and covering sporadic simple groups.
• Beyond graph energy: norms of graphs and matrices
• New potential functions for greedy independence and coloring
• On a generalization of the spectral Mantel's theorem
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
• The VC-dimension of set systems defined by graphs
• Turán-type results for distance graphs in an infinitesimal plane layer
• Saturating Sperner families
• Stability for the Erdős-Rothschild problem
• Embedding complete trees into the hypercube
• Packing and covering balls in graphs excluding a minor
• Three-graphs without two triples whose symmetric difference is contained in a third
• On Minkowski sums of simplices
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
• On the number of cliques in graphs with a forbidden minor
• Title not available (Why is that?)
• Compactness and finite forcibility of graphons
• On Two Problems in Ramsey--Turán Theory
• Rainbow Erdös--Rothschild Problem for the Fano Plane
• Unavoidable hypergraphs
• Short proofs of some extremal results III
• On off-diagonal ordered Ramsey numbers of nested matchings
• On local Turán problems
• Some sharp results on the generalized Turán numbers
• The maximum spectral radius of graphs without spanning linear forests
• The feasible region of hypergraphs
• The Forest Number of (n,m)-Graphs
• A note on bipartite subgraphs and triangle-independent sets
• A randomized version of Ramsey's theorem
• Dense induced bipartite subgraphs in triangle-free graphs
• Turán's theorem implies Stanley's bound
• Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
• Extremal numbers for directed hypergraphs with two edges
• Some results on \(k\)-Turán-good graphs
• Inverse Turán numbers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5781249)