scientific article; zbMATH DE number 3050594

Cited in

(only showing first 100 items - show all)

The maximum number of triangles in \(F_k\)-free graphs
Toughness in graphs -- a survey
A 2-stable family of triple systems
Rainbow Saturation for Complete Graphs
On non-degenerate Berge-Turán problems
Triangle-free intersection graphs of line segments with large chromatic number
Supersaturation for subgraph counts
On the super domination number of lexicographic product graphs
Exact bounds for some hypergraph saturation problems
Some exact results for generalized Turán problems
The Local metric dimension of the lexicographic product of graphs
Extremal problems for the p-spectral radius of graphs
On saturated k-Sperner systems
Generalized planar Turán numbers
Some exact results of the generalized Turán numbers for paths
Sur le joint d'une famille de graphes
Ramsey numbers for degree monotone paths
Coloring intersection graphs of arc-connected sets in the plane
The maximum number of paths of length four in a planar graph
On the maximum number of maximum independent sets of bipartite graphs
The constructor-blocker game
On the Ramsey-Turán density of triangles
A simple branching scheme for vertex coloring problems
Graph cover-saturation
Four-vertex traces of finite sets
Flag complexes and homology
On triangle-free graphs maximizing embeddings of bipartite graphs
A short proof of the existence of highly chromatic hypergraphs without short cycles
Saturation in the hypercube and bootstrap percolation
The minimum number of clique-saturating edges
Perfect graphs of arbitrarily large clique-chromatic number
Graph colourings and partitions
Column-wise extendible vector expressions and the relational computation of sets of sets
An exact approach for the vertex coloring problem
Regular saturated graphs and sum-free sets
Solving the list coloring problem through a branch-and-price algorithm
Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
An exact algorithm for parallel machine scheduling with conflicts
A branch and price algorithm for list coloring problem
Independent vertex sets in the Zykov sum
On vertex-Euclidean deficiency of complete fan graphs and complete wheel graphs
Generalized Turán results for edge blow-up of star forests
Generalized Turán problems for double stars
Paths are Turán-good
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
On Turán-good graphs
Some results on k-Turán-good graphs
Paths of length three are \(K_{r+1}\)-Turán-good
Lagrangian densities of linear forests and Turán numbers of their extensions
On generalized Turán number of two disjoint cliques
Randomly colouring graphs (a combinatorial view)
Strong Turán stability
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
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
The chromaticity of certain graphs with five triangles
On the generalized Turán problem for odd cycles
Many cliques with few edges and bounded maximum degree
Exact weighted vertex coloring via branch-and-price
On the independent set sequence of a tree
DP color functions versus chromatic polynomials
\(t\)-wise Berge and \(t\)-heavy hypergraphs
Tree densities in sparse graph classes
Generalized Turán problems for complete bipartite graphs
Large joints in graphs
Multicolor list Ramsey numbers grow exponentially
Cliques in graphs excluding a complete graph minor
Subgraph densities in a surface
Refinement on Spectral Turán’s Theorem
Partite saturation of complete graphs
Intersection density of imprimitive groups of degree \(pq\)
Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs
Localised graph Maclaurin inequalities
An exact algorithm for the partition coloring problem
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
Tight concentration of star saturation number in random graphs
Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs
The fractional chromatic number of Zykov products of graphs
Independence number and maximal chromatic polynomials of connected graphs
Fractional Turan's theorem and bounds for the chromatic number
Joins of circulant matrices
On supersaturation and stability for generalized Turán problems
Analytic methods for uniform hypergraphs
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
Planar Turán number of the 6-cycle
Generalized Turán problems for \(K_{2,t}\)
Turán graphs with bounded matching number
Generalized Turán problems for even cycles
Local k-colorings of graphs and hypergraphs
Counting copies of a fixed subgraph in \(F\)-free graphs
The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic 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 Q5790850)