On graphs and algebraic graphs that do not contain cycles of length 4

DOI10.1002/jgt.20542zbMath1232.05102OpenAlexW1996463805MaRDI QIDQ3174238

Christian Knauer, Raphael Yuster, Noga Alon, H. Tracy Hall, Rom Pinchasi

Publication date: 12 October 2011

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

Full work available at URL: https://doi.org/10.1002/jgt.20542

zbMATH Keywords

bipartitesquare-freeminimum rankforbidden subgraphalgebraic graphadjacency rankgraph regularitymultiset regularitysquare-avoiding

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Cycles of nonzero elements in low rank matrices
• Extremal problems in discrete geometry
• Problems and results in extremal combinatorics. I.
• Some structural properties of low-rank matrices related to computational complexity

This page was built for publication: On graphs and algebraic graphs that do not contain cycles of length 4