Rank and chromatic number of a graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<1::AID-JGT1>3.0.CO;2-N" /><1::AID-JGT1>3.0.CO;2-N 10.1002/(SICI)1097-0118(199709)26:1<1::AID-JGT1>3.0.CO;2-NzbMath0878.05033OpenAlexW1972004553MaRDI QIDQ4355066

Andreĭ V. Kotlov

Publication date: 7 December 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199709)26:1<1::aid-jgt1>3.0.co;2-n

zbMATH Keywords

independence numberrankchromatic numbertwin-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank ⋮ Some relations among term rank, clique number and list chromatic number of a graph ⋮ Around the log-rank conjecture ⋮ On order and rank of graphs ⋮ On the rank of a matrix associated with a graph. ⋮ Matrix rank and communication complexity ⋮ Maximum order of trees and bipartite graphs with a given rank ⋮ Unnamed Item ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity ⋮ Maximum Order of Triangle‐Free Graphs with a Given Rank ⋮ Chromatic number and the 2-rank of a graph

This page was built for publication: Rank and chromatic number of a graph