scientific article; zbMATH DE number 3041944
From MaRDI portal
Publication:5781249
zbMath0026.26903MaRDI QIDQ5781249
Publication date: 1941
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Nearly-Regular Hypergraphs and Saturation of Berge Stars, Making Kr+1-free graphs r-partite, The chromatic profile of locally colourable graphs, Stability for the Erdős-Rothschild problem, Tree densities in sparse graph classes, Unnamed Item, A generalization of a Turán’s theorem about maximum clique on graphs, Harary polynomials, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation, The Forest Number of (n,m)-Graphs, Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth, ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE, Counting independent sets in triangle-free graphs, Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors, The Turán number of the graph 3P5, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier, New and improved results on the signed (total) k-domination number of graphs, Planar Turán Number of the 6-Cycle, An extremal graph problem, Hypergraph Turán densities can have arbitrarily large algebraic degree, Linear maps on nonnegative symmetric matrices preserving the independence number, Generalized Turán problems for double stars, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, On a generalization of the spectral Mantel's theorem, The maximum number of triangles in \(F_k\)-free graphs, Turán and Ramsey numbers for 3‐uniform minimal paths of length 4, Turán numbers for disjoint paths, Extremal graphs for odd wheels, On the maximum number of odd cycles in graphs without smaller odd cycles, Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings, On Two Problems in Ramsey--Turán Theory, A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs, Refinement on Spectral Turán’s Theorem, Lagrangian-perfect hypergraphs, Optimizing diversity, The prime submodules hypergraph of a free module of finite rank over a commutative ring, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Unnamed Item, The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques, Unnamed Item, Unnamed Item, Tree decompositions of graphs without large bipartite holes, Unnamed Item, The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, Provably Shorter Regular Expressions from Deterministic Finite Automata, Many \(T\) copies in \(H\)-free graphs, A proof for a conjecture of Gorgol, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Extremal Graphs with Local Covering Conditions, Unnamed Item, Extremal non-bipartite regular graphs of girth 4, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, The strongest facets of the acyclic subgraph polytope are unknown, Relative Turán Problems for Uniform Hypergraphs, Embedding complete trees into the hypercube, Unnamed Item, Lower bounds on the signed (total) $k$-domination number, Ramsey numbers for tournaments, Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille, Unnamed Item, Supersaturation problem for the bowtie, A median-type condition for graph tiling, A tighter relation between sensitivity complexity and certificate complexity, A priori optimization for the probabilistic maximum independent set problem, Local resilience of graphs, Simple and local independent set approximation, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\), Some Motzkin-Straus type results for non-uniform hypergraphs, Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs, On clique values identities and mantel-type theorems, Many \(T\) copies in \(H\)-free graphs, Unnamed Item, Rainbow Erdös--Rothschild Problem for the Fano Plane, Metric dimension: from graphs to oriented graphs, Signed and Minus Dominating Functions in Graphs, Asymptotic Structure for the Clique Density Theorem, Short proofs of some extremal results III, Vertex Ramsey properties of randomly perturbed graphs, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Unnamed Item, Unnamed Item, Unnamed Item, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, Turán Graphs, Stability Number, and Fibonacci Index, All My Favorite Conjectures Are Critical, Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree, Graphs with coloring redundant edges, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, Lefschetz properties for Artinian Gorenstein algebras presented by quadrics, Maker-Breaker Games on Randomly Perturbed Graphs, Crossings Between Non-homotopic Edges, An Evans-Style Result for Block Designs, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, ?Best? estimations on the distribution of the length of sums of two random vectors, On the Stability of the Graph Independence Number, Augmenting weighted graphs to establish directed point-to-point connectivity, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, The Turán numbers of special forests, Remarks on an edge-coloring problem, Construction of a family of graphs with a small induced proper subgraph with minimum degree 3, On the structure of linear graphs, A note on bipartite subgraphs and triangle-independent sets, A Motzkin-Straus type result for 3-uniform hypergraphs, A note on the Turán number of an arbitrary star forest, Turán-type results for distance graphs in an infinitesimal plane layer, The spectral radius of graphs with no intersecting odd cycles, The Turán number of the triangular pyramid of 3-layers, On the asymptotic enumeration of Cayley graphs, Turán number of disjoint triangles in 4-partite graphs, Generalized rainbow Turán problems, Generalized Turán number for linear forests, Some results on Lagrangians of hypergraphs, On the number of edges in geometric graphs without empty triangles, Edge-minimum saturated \(k\)-planar drawings, Guessing numbers and extremal graph theory, Embedding partial totally symmetric quasigroups., Co-degree density of hypergraphs, On generalized Turán number of two disjoint cliques, Singular Turán numbers and worm-colorings, The Turán number for \(4 \cdot S_{\ell}^1\), Some extremal results on hypergraph Turán problems, The number of copies of \(K_{2,t+1}\) in a graph, Three conjectures in extremal spectral graph theory, On the number of cliques in graphs with a forbidden minor, Extremal graphs for blow-ups of keyrings, On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\), Complete subgraphs in connected graphs and its application to spectral moment, A unique characterization of spectral extrema for friendship graphs, Forbidding \(K_{2,t}\) traces in triple systems, The signless Laplacian spectral radius of graphs with forbidding linear forests, Extremal graphs for odd-ballooning of paths and cycles, Extremal graphs for edge blow-up of graphs, Vertex Turán problems for the oriented hypercube, On the abstract chromatic number and its computability for finitely axiomatizable theories, A class of spectral bounds for max \(k\)-cut, The number of 4-cycles in a graph, Extremal \(H\)-free planar graphs, Crossings between non-homotopic edges, Degree powers of graphs without \(B_{\ell,s}\), Extremal \(k\)-forcing sets in oriented graphs, Graphs with large maximum degree containing no edge-critical graphs, The formula for Turán number of spanning linear forests, Inverting the Turán problem, On a conjecture of spectral extremal problems, The maximum spectral radius of graphs without spanning linear forests, Spectral extremal graphs for disjoint cliques, Generalized Turán problems for even cycles, Generalized Turán problems for \(K_{2,t}\), Turán problems for edge-ordered graphs, Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation, New lower bounds for the Turán density of \(PG_m(q)\), The Turán number for the edge blow-up of trees: the missing case, Estimating and understanding exponential random graph models, Graphs with many edge-colorings such that complete graphs are rainbow, Topological designs, The Turán number of directed paths and oriented cycles, On a conjecture of Erdős and Simonovits: even cycles, Signed \(k\)-independence in graphs, Restricted arc-connectivity of bipartite tournaments, Maximising the number of cycles in graphs with forbidden subgraphs, Upper bounds on positional Paris-Harrington games, The domination number of the graph defined by two levels of the \(n\)-cube. II, Large cliques in hypergraphs with forbidden substructures, Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number, Shattered matchings in intersecting hypergraphs, The Turán number for the edge blow-up of trees, Local-edge-connectivity in digraphs and oriented graphs, Strongly 4-path-connectivity in almost regular multipartite tournaments, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Some new results on the Turán number of star forests, New potential functions for greedy independence and coloring, Shifted products that are coprime pure powers, A note on kernels of intersecting families, Super-edge-connectivity and zeroth-order Randić index, Two approaches to Sidorenko’s conjecture, The typical structure of sparse $K_{r+1}$-free graphs, On the triangle clique cover and \(K_t\) clique cover problems, A note on Turán's theorem, 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs, Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs, Turán's theorem implies Stanley's bound, Two results about the Turán number of star forests, \( L ( 2 , 1 )\)-labeling of disk intersection graphs, On some extremal problems on \(r\)-graphs, The maximum number of colorings of graphs of given order and size: a survey, Weighted Turán problems with applications, Extremal problems for directed graphs, Generalized Turán problems for disjoint copies of graphs, On a valence problem in extremal graph theory, Colouring set families without monochromatic \(k\)-chains, Compactness and finite forcibility of graphons, On the domination number of a graph defined by containment, Planar Turán numbers of short paths, Turán numbers and batch codes, New upper bound for the chromatic number of a random subgraph of a distance graph, 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, Maximum induced trees in graphs, Extremal graphs for blow-ups of stars and paths, Uniquely tree-saturated graphs, Compression of finite-state automata through failure transitions, Another extremal problem for Turan graphs, Cliques in graphs excluding a complete graph minor, On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, Streaming algorithms for independent sets in sparse hypergraphs, The clique density theorem, Intersection properties of boxes. I: An upper-bound theorem, Longest cycles in almost regular 3-partite tournaments, Embedding partial triple systems, Exact solution of some Turán-type problems, Extremal results for random discrete structures, Combinatorial theorems in sparse random sets, Forbidden graphs for degree and neighbourhood conditions, Saturating Sperner families, A note on Turán numbers for even wheels, Rainbow generalizations of Ramsey theory: A survey, Average dimension of fixed point spaces with applications., The maximal length of a gap between \(r\)-graph Turán densities, On the Turán number of forests, On the codegree density of complete 3-graphs and related problems, A maximum degree theorem for diameter-2-critical graphs, Some extremal problems for hereditary properties of graphs, A note on independent sets in graphs with large minimum degree and small cliques, Extremal problems for the \(p\)-spectral radius of graphs, Global aspects of the space of 6D \(\mathcal{N} = 1\) supergravities, Constructing heterogeneous hash families by puncturing linear transversal designs, Rainbow numbers for graphs containing small cycles, Complete \(r\)-partite graphs determined by their domination polynomial, Saturation numbers for linear forests \(P_5\cup tP_2\), Combinatorics on partial word borders, Degree condition and \(Z_3\)-connectivity, \(k\)-restricted edge-connectivity in triangle-free graphs, New bounds on the maximum number of edges in \(k\)-quasi-planar graphs, Graphs with maximum size and lower bounded girth, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, The number of \(K_{m,m}\)-free graphs, Large dense neighbourhoods and Turán's theorem, On graph-Lagrangians of hypergraphs containing dense subgraphs, Triangle-free partial graphs and edge covering theorems, Turán problems on non-uniform hypergraphs, Lower bounds on the stability number of graphs computed in terms of degrees, Perfect matchings in total domination critical graphs, On Minkowski sums of simplices, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite, \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs, The maximum edit distance from hereditary graph properties, Extremal results for odd cycles in sparse pseudorandom graphs, Edges in graphs with large girth, Intersection properties of boxes. II: Extremal families, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Saturated \(r\)-uniform hypergraphs, On embedding well-separable graphs, Ore-condition and \(Z_3\)-connectivity, Total domination edge critical graphs with total domination number three and many dominating pairs, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey, On Lagrangians of \(r\)-uniform hypergraphs, The effect of edge weights on clique weights, On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs, An application of the Turán theorem to domination in graphs, Making a \(K_4\)-free graph bipartite, Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, The edge density of critical digraphs, A tournament approach to pattern avoiding matrices, New results on \(k\)-independence of graphs, A note on an embedding problem in transitive tournaments, Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants, On finite simple groups and Kneser graphs., On the eccentric distance sum of graphs, Three-graphs without two triples whose symmetric difference is contained in a third, An analytic approach to stability, The early evolution of the \(H\)-free process, Développements recents de la théorie des graphes, Pairwise generating and covering sporadic simple groups., A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs, Hadamard decompositions of nearly commutative algebras, A stability theorem for maximal \(K_{r+1}\)-free graphs, Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs, Beyond graph energy: norms of graphs and matrices, Linear hash families and forbidden configurations, A problem of Erdős on the minimum number of \(k\)-cliques, A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane, A spectral approach to polyhedral dimension, Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\), 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, Fibonacci index and stability number of graphs: a polyhedral study, On non-strong jumping numbers and density structures of hypergraphs, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, On Helly families of maximal size, Union-free hypergraphs and probability theory, Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees, Turán number for odd‐ballooning of trees, A note on maximum size of a graph without isolated vertices under the given matching number, Extremal numbers of disjoint triangles in \(r\)-partite graphs, Some position problems for graphs, On Turán numbers for disconnected hypergraphs, Online team formation under different synergies, The complexity of finding tangles, Maximum cliques in a graph without disjoint given subgraph, Planar Turán numbers of cubic graphs and disjoint union of cycles, VC-dimensions for graphs (extended abstract), A 2-stable family of triple systems, F$F$‐factors in Quasi‐random Hypergraphs, Fractional Helly theorem for Cartesian products of convex sets, Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs, Four-vertex traces of finite sets, Transversals in regular uniform hypergraphs, On the Turán Number of Generalized Theta Graphs, Turán‐type problems for long cycles in random and pseudo‐random graphs, On the Turán number of \(K_m \vee C_{2k-1}\), Tight bounds for divisible subdivisions, Turán graphs with bounded matching number, Spectral Turán problems for intersecting even cycles, Edge-colorings avoiding patterns in a triangle, Restricted problems in extremal combinatorics, On Turán problems with bounded matching number, Extremal numbers for disjoint copies of a clique, The complete value of the Turán number of \(3K_{p+1}\), The induced saturation problem for posets, Unnamed Item, Finding and counting small induced subgraphs efficiently, Improved bounds on the \(k\)-tuple (Roman) domination number of a graph, On 1-subdivisions of transitive tournaments, Turán numbers for hypergraph star forests, Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\), Maximum cliques of hypergraphs and polynomial optimization, Testing metric properties, Spectral extremal graphs for intersecting cliques, On unique independent sets in graphs, Clique-partitioned graphs, The ferry cover problem on regular graphs and small-degree graphs, Gaps in the saturation spectrum of trees, Edge-colorings avoiding a fixed matching with a prescribed color pattern, The decision-tree complexity of element distinctness, On ordered Ramsey numbers of bounded-degree graphs, Greedy clique decompositions and the Turán numbers, The size of graphs with clique number \(m\) and without nowhere-zero 4-flows, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, Triangle-free four-chromatic graphs, Turán function and \(H\)-decomposition problem for gem graphs, Retracted: A remark on the weak Turán's theorem, The VC-dimension of set systems defined by graphs, Extremal theory for convex matchings in convex geometric graphs, Improved approximations for maximum independent set via approximation chains, On the Turán number of some ordered even cycles, Embedding partial extended triple systems and totally symmetric quasigroups, Uniquely \(C _{4}\)-saturated graphs, Some extremal results on complete degenerate hypergraphs, The extremal graph problem of the icosahedron, The non-isolated vertices in the generating graph of a direct powers of simple groups., The codegree threshold of \(K_4^-\), The minimum number of triangles in graphs of given order and size, Turán numbers for odd wheels, Nonatomic mutual exclusion with local spinning, Degree powers in graphs with a forbidden forest, Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number, Edges not in any monochromatic copy of a fixed graph, Strong forms of stability from flag algebra calculations, The Turán number for spanning linear forests, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, On the Turán density of \(\{1, 3\}\)-hypergraphs, Spectral extremal results with forbidding linear forests, Dense subgraphs in random graphs, Dense 3-uniform hypergraphs containing a large clique, Unavoidable hypergraphs, Bipartite algebraic graphs without quadrilaterals, Colourings without monochromatic disjoint pairs, Extremal numbers for directed hypergraphs with two edges, On the existence of Frobenius digraphical representations, The feasible region of hypergraphs, Dense induced bipartite subgraphs in triangle-free graphs, On local Turán problems, Some sharp results on the generalized Turán numbers, Packing triangles in \(K_4\)-free graphs, The intersection numbers of a complex, Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints, Equipartite colorings in graphs and hypergraphs, On graphs which contain all small trees, Flag complexes and homology, Some results on \(k\)-Turán-good graphs, A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems, Cut and pendant vertices and the number of connected induced subgraphs of a graph, Generalized Turán number of even linear forests, Relative Turán numbers for hypergraph cycles, Packing and covering balls in graphs excluding a minor, The lower and upper bounds of Turán number for odd wheels, Conditional chromatic numbers with forbidden cycles, A universal exponent for homeomorphs, On the Turán number of theta graphs, Triangle-free subgraphs of hypergraphs, A note on stability for maximal \(F\)-free graphs, Unified approach to the generalized Turán problem and supersaturation, Small rainbow cliques in randomly perturbed dense graphs, A sharp threshold phenomenon in string graphs, Embeddings of partial Steiner triple systems, The number of graphs without forbidden subgraphs, On the maximal number of elements pairwise generating the symmetric group of even degree, On a geometric combinatorial problem, On the maxima of Motzkin-Straus programs and cliques of graphs, Induced subgraphs of given sizes, On subgraphs of tripartite graphs, Generalized outerplanar Turán number of short paths, The structure of graphs with given lengths of cycles, The maximum spectral radius of non-bipartite graphs forbidding short odd cycles, Improved bounds on a generalization of Tuza's conjecture, A hypergraph Turán problem with no stability, An upper bound for the Turán number \(t_3(n,4)\), Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, The feasibility problem for line graphs, Turán's theorem and maximal degrees, On off-diagonal ordered Ramsey numbers of nested matchings, Generalized Turán densities in the hypercube, Counting cliques in 1-planar graphs, A linear hypergraph extension of Turán's theorem, Inverse Turán numbers, The Erdős-Hajnal conjecture for three colors and triangles, Extremal problems and generalized degrees, Largest size and union of Helly families, Supersaturation for subgraph counts, Extremal graphs for two vertex-disjoint copies of a clique, The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
