scientific article; zbMATH DE number 3050594
From MaRDI portal
zbMath0033.02602MaRDI QIDQ5790850
Publication date: 1949
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Paths of length three are \(K_{r+1}\)-Turán-good, Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs, A branch and price algorithm for list coloring problem, Some exact results for generalized Turán problems, Ramsey numbers for degree monotone paths, Local \(k\)-colorings of graphs and hypergraphs, Cliques in graphs excluding a complete graph minor, Generalized rainbow Turán problems, Generalized Turán number for linear forests, Extremal digraphs with given clique number, Fractional Turan's theorem and bounds for the chromatic number, On the Ramsey-Turán density of triangles, Joins of circulant matrices, On generalized Turán number of two disjoint cliques, An exact algorithm for the partition coloring problem, Intersection properties of boxes. I: An upper-bound theorem, The vertex Euclidean properties of graphs, Chromatic equivalence classes of certain generalized polygon trees, On the number of cliques in graphs with a forbidden minor, An exact algorithm for parallel machine scheduling with conflicts, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, The maximum number of paths of length four in a planar graph, Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable, Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number, Generalized planar Turán numbers, A note on rainbow saturation number of paths, Generalized rainbow Turán numbers of odd cycles, Large joints in graphs, The energy of a simplicial complex, The Ramsey-Turán problem for cliques, The fractional chromatic number of Zykov products of graphs, Triangle-free intersection graphs of line segments with large chromatic number, On the super domination number of lexicographic product graphs, Extremal problems for the \(p\)-spectral radius of graphs, On saturated \(k\)-Sperner systems, The minimum number of clique-saturating edges, Perfect graphs of arbitrarily large clique-chromatic number, Chromatic polynomials for regular graphs and modified wheels, Star saturation number of random graphs, Generalized Turán problems for even cycles, Generalized Turán problems for \(K_{2,t}\), An exact approach for the vertex coloring problem, The maximum number of complete subgraphs in a graph with given maximum degree, Partitive hypergraphs, Exact weighted vertex coloring via branch-and-price, On the maximum number of cliques in a graph embedded in a surface, Randomly colouring graphs (a combinatorial view), Coloring intersection graphs of arc-connected sets in the plane, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, \(K_{s,t}\)-saturated bipartite graphs, Intersection properties of boxes. II: Extremal families, Bounds on graph eigenvalues. II, Regular saturated graphs and sum-free sets, Many cliques with few edges and bounded maximum degree, General lemmas for Berge-Turán hypergraph problems, Independent vertex sets in the Zykov sum, Analytic methods for uniform hypergraphs, On the maximum number of maximum independent sets, Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors, Exact bounds for some hypergraph saturation problems, Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture, Toughness in graphs -- a survey, A Nice labelling for tree-like event structures of degree 3, Spectra of generalized compositions of graphs and hierarchical networks, The Local metric dimension of the lexicographic product of graphs, Coefficient relationship between rook and chromatic polynomials, On Turán-good graphs, Stirling number identities from chromatic polynomials, Flag complexes and homology, Some results on \(k\)-Turán-good graphs, Vertex elimination orderings for hereditary graph classes, The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension, Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions, The shifting method and generalized Turán number of matchings, Maximizing five-cycles in \(K_r\)-free graphs, A short proof of the existence of highly chromatic hypergraphs without short cycles, A problem of Erdős on the minimum number of \(k\)-cliques, On the independent set sequence of a tree, The inductive graph dimension from the minimum edge clique cover, Hypergraph based Berge hypergraphs, Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle, On fractional cut covers, A simple branching scheme for vertex coloring problems, DP color functions versus chromatic polynomials, Chromatic capacities of graphs and hypergraphs, Sur le joint d'une famille de graphes, Counting copies of a fixed subgraph in \(F\)-free graphs, Generalized Turán problems for complete bipartite graphs, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, An irrational Turán density via hypergraph Lagrangian densities, Graph cover-saturation, Generalized outerplanar Turán number of short paths, Turán's theorem and maximal degrees, Generalized Turán densities in the hypercube, The chromaticity of certain graphs with five triangles, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, Further results on the generalized Turán number of spanning linear forests, The generalized Turán number of spanning linear forests, Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles, Supersaturation for subgraph counts, Subgraph densities in a surface, Stability for the Erdős-Rothschild problem, Tree densities in sparse graph classes, Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets, Planar Turán Number of the 6-Cycle, Generalized Turán problems for double stars, Paths are Turán-good, On a generalization of the spectral Mantel's theorem, On supersaturation and stability for generalized Turán problems, The maximum number of triangles in \(F_k\)-free graphs, Multicolor list Ramsey numbers grow exponentially, The maximum number of paths of length three in a planar graph, Refinement on Spectral Turán’s Theorem, Stability from graph symmetrisation arguments with applications to inducibility, Some exact results for non-degenerate generalized Turán problems, Maximum cliques in a graph without disjoint given subgraph, A 2-stable family of triple systems, Rainbow Saturation for Complete Graphs, On non-degenerate Berge-Turán problems, Four-vertex traces of finite sets, Unnamed Item, Cycle Saturation in Random Graphs, Many Cliques in Bounded-Degree Hypergraphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Tight concentration of star saturation number in random graphs, Lagrangian densities of linear forests and Turán numbers of their extensions, Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs, Turán graphs with bounded matching number, Improving upper bounds for the distinguishing index, Saturation in the Hypercube and Bootstrap Percolation, Some exact results of the generalized Turán numbers for paths, $t$-Wise Berge and $t$-Heavy Hypergraphs, Stabilizing the distinguishing number of a graph, Patterns in Khovanov link and chromatic graph homology, The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs, Strong Turán stability, Unnamed Item, Graph colourings and partitions, On the inducibility of cycles, Partite Saturation of Complete Graphs, Nordhaus-Gaddum type inequalities for the distinguishing index, Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
