scientific article; zbMATH DE number 3050594

zbMATH Open0033.02602MaRDI QIDQ5790850FDOQ5790850

Authors: Alexander A. Zykov 

Publication date: 1949

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

zbMATH Keywords

Topology

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

• Some exact results for generalized Turán problems
• The Local metric dimension of the lexicographic product of graphs
• Generalized planar Turán numbers
• Some exact results of the generalized Turán numbers for paths
• Ramsey numbers for degree monotone paths
• The maximum number of paths of length four in a planar graph
• Graph cover-saturation
• The minimum number of clique-saturating edges
• Regular saturated graphs and sum-free sets
• Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
• An exact algorithm for parallel machine scheduling with conflicts
• Independent vertex sets in the Zykov sum
• A branch and price algorithm for list coloring problem
• Lagrangian densities of linear forests and Turán numbers of their extensions
• On Turán-good graphs
• Some results on \(k\)-Turán-good graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• On generalized Turán number of two disjoint cliques
• Strong Turán stability
• 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
• Further results on the generalized Turán number of spanning linear forests
• An irrational Turán density via hypergraph Lagrangian densities
• Generalized Turán number for linear forests
• The shifting method and generalized Turán number of matchings
• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• Tree densities in sparse graph classes
• Many cliques with few edges and bounded maximum degree
• DP color functions versus chromatic polynomials
• Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs
• On supersaturation and stability for generalized Turán problems
• Joins of circulant matrices
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• The vertex Euclidean properties of graphs
• Generalized rainbow Turán problems
• Generalized rainbow Turán numbers of odd cycles
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• The inductive graph dimension from the minimum edge clique cover
• Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number
• Hypergraph based Berge hypergraphs
• Stabilizing the distinguishing number of a graph
• The maximum number of paths of length three in a planar graph
• Improving upper bounds for the distinguishing index
• A note on rainbow saturation number of paths
• The energy of a simplicial complex
• Stability from graph symmetrisation arguments with applications to inducibility
• Many Cliques in Bounded-Degree Hypergraphs
• Generalized outerplanar Turán number of short paths
• Star saturation number of random graphs
• The Ramsey-Turán problem for cliques
• On fractional cut covers
• Vertex elimination orderings for hereditary graph classes
• Toughness in graphs -- a survey
• Supersaturation for subgraph counts
• Triangle-free intersection graphs of line segments with large chromatic number
• On the super domination number of lexicographic product graphs
• Exact bounds for some hypergraph saturation problems
• Sur le joint d'une famille de graphes
• Extremal problems for the \(p\)-spectral radius of graphs
• On saturated \(k\)-Sperner systems
• On the Ramsey-Turán density of triangles
• Coloring intersection graphs of arc-connected sets in the plane
• A simple branching scheme for vertex coloring problems
• Flag complexes and homology
• Saturation in the hypercube and bootstrap percolation
• Graph colourings and partitions
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Column-wise extendible vector expressions and the relational computation of sets of sets
• Perfect graphs of arbitrarily large clique-chromatic number
• An exact approach for the vertex coloring problem
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
• Chromatic capacities of graphs and hypergraphs
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• Turán's theorem and maximal degrees
• Randomly colouring graphs (a combinatorial view)
• The chromaticity of certain graphs with five triangles
• On the independent set sequence of a tree
• Exact weighted vertex coloring via branch-and-price
• Generalized Turán problems for complete bipartite graphs
• Partite saturation of complete graphs
• Large joints in graphs
• Cliques in graphs excluding a complete graph minor
• An exact algorithm for the partition coloring problem
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• The fractional chromatic number of Zykov products of graphs
• Analytic methods for uniform hypergraphs
• Fractional Turan's theorem and bounds for the chromatic number
• On the maximum number of cliques in a graph embedded in a surface
• Coefficient relationship between rook and chromatic polynomials
• Stirling number identities from chromatic polynomials
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• Local \(k\)-colorings of graphs and hypergraphs
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Spectra of generalized compositions of graphs and hierarchical networks
• A Nice labelling for tree-like event structures of degree 3
• A problem of Erdős on the minimum number of \(k\)-cliques
• \(K_{s,t}\)-saturated bipartite graphs

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 Q5790850)