Maximum Order of Triangle‐Free Graphs with a Given Rank

DOI10.1002/jgt.21822zbMath1312.05080arXiv1404.3553OpenAlexW1857903526MaRDI QIDQ5251207

B. Tayfeh-Rezaie, Ebrahim Ghorbani, Ali Mohammadian

Publication date: 22 May 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.3553

zbMATH Keywords

ranktriangle-free graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (4)

Maximum order of graphs with a given corank ⋮ A discrete variation of the Littlewood-Offord problem ⋮ On order and rank of graphs ⋮ Maximal graphs with respect to rank

Cites Work

• Unnamed Item
• The maximum order of adjacency matrices of graphs with a given rank
• The rank of a cograph
• Maximum order of trees and bipartite graphs with a given rank
• Rank and chromatic number of a graph
• Fundamentals of Error-Correcting Codes
• The rank and size of graphs

This page was built for publication: Maximum Order of Triangle‐Free Graphs with a Given Rank