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
• The exact minimum number of triangles in graphs with given order and size
• 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
• Counting cliques in 1-planar graphs
• 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
• 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
• 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
• Testing metric properties
• The maximum number of colorings of graphs of given order and size: a survey
• On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
• An application of the Turán theorem to domination in graphs
• Supersaturation for subgraph counts
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A note on an embedding problem in transitive tournaments
• Extremal graphs for blow-ups of stars and paths
• Vertex Turán problems for the oriented hypercube
• Harary polynomials
• Lower bounds on the signed (total) \(k\)-domination number
• Local-edge-connectivity in digraphs and oriented graphs
• On non-strong jumping numbers and density structures of hypergraphs
• A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
• Lefschetz properties for Artinian Gorenstein algebras presented by quadrics
• Vertex Ramsey properties of randomly perturbed graphs
• Forbidden graphs for degree and neighbourhood conditions
• Longest cycles in almost regular 3-partite tournaments
• Upper bounds on positional Paris-Harrington games
• Improved approximations for maximum independent set via approximation chains
• Signed and minus dominating functions in graphs
• A priori optimization for the probabilistic maximum independent set problem
• Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
• Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
• The structure of graphs with given lengths of cycles
• A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• Union-free hypergraphs and probability theory
• On a conjecture of spectral extremal problems
• Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
• Large cliques in hypergraphs with forbidden substructures
• A spectral approach to polyhedral dimension
• Complete \(r\)-partite graphs determined by their domination polynomial
• Saturation numbers for linear forests \(P_5\cup tP_2\)
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Extremal problems and generalized degrees
• A problem of Erdős on the minimum number of \(k\)-cliques
• The Turán number for spanning linear forests
• On an extremal problem in graph theory.
• On the independence number of non-uniform uncrowded hypergraphs
• Strong chromatic index of \(K_{1, t}\)-free graphs
• Packing triangles in \(K_4\)-free graphs
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• On Helly families of maximal size

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)