𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Graphs That Do Not Contain The Cube And Related Problems

✍ Scribed by Rom Pinchasi; Micha Sharir*

Book ID
106167569
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
156 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs and algebraic graphs that do n
On graphs and algebraic graphs that do not contain cycles of length 4
✍ Noga Alon; H. Tracy Hall; Christian Knauer; Rom Pinchasi; Raphael Yuster πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

We consider extremal problems for algebraic graphs, that is, graphs whose vertices correspond to vectors in R d , where two vectors are connected by an edge according to an algebraic condition. We also derive a lower bound on the rank of the adjacency matrix of a general abstract graph using the num

On quadrilaterals in layers of the cube
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
✍ Schelp, Richard H.; Thomason, Andrew πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 2 views

ErdΕ‘s has conjectured that every subgraph of the n-cube Q n having more than (1/2+o(1))e(Q n ) edges will contain a 4-cycle. In this note we consider 'layer' graphs, namely, subgraphs of the cube spanned by the subsets of sizes k -1, k and k + 1, where we are thinking of the vertices of Q n as being