scientific article; zbMATH DE number 3041944

zbMATH Open0026.26903MaRDI QIDQ5781249FDOQ5781249

Authors: 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)

• Maker-Breaker games on randomly perturbed graphs
• Unavoidable hypergraphs
• 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
• Improved bound on the maximum number of clique-free colorings with two and three colors
• 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
• Extremal numbers for directed hypergraphs with two edges
• Some results on \(k\)-Turán-good graphs
• Inverse Turán numbers
• Inverting the Turán problem
• Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
• Restricted arc-connectivity of bipartite tournaments
• Shifted products that are coprime pure powers
• Generalized Turán number of even linear forests
• Relative Turán numbers for hypergraph cycles
• The lower and upper bounds of Turán number for odd wheels
• Generalized Turán number for linear forests
• The formula for Turán number of spanning linear forests
• Degree powers of graphs without \(B_{\ell,s}\)
• Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
• Rainbow Erdös-Rothschild problem for the Fano plane
• Turán numbers and batch codes
• The number of 4-cycles in a graph
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Generalized Turán problems for even cycles
• Generalized rainbow Turán problems
• Title not available (Why is that?)
• A universal exponent for homeomorphs
• Unified approach to the generalized Turán problem and supersaturation
• Hypergraph removal lemmas via robust sharp threshold theorems
• Triangle-free subgraphs of hypergraphs
• Graphs with many edge-colorings such that complete graphs are rainbow
• Short proofs of some extremal results. III
• Turán numbers for disjoint paths
• The Turán number of the triangular pyramid of 3-layers
• Planar Turán numbers of short paths
• A sharp threshold phenomenon in string graphs
• Small rainbow cliques in randomly perturbed dense graphs
• On the maximal number of elements pairwise generating the symmetric group of even degree
• Generalized outerplanar Turán number of short paths
• The Turán number of directed paths and oriented cycles
• A generalization of a Turán's theorem about maximum clique on graphs
• On Turán numbers for disconnected hypergraphs
• On the maxima of Motzkin-Straus programs and cliques of graphs
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
• On subgraphs of tripartite graphs
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
• The feasibility problem for line graphs
• 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
• On two problems in Ramsey-Turán theory
• On the number of maximum independent sets of graphs
• 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
• Relative Turán problems for uniform hypergraphs

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)