The following pages link to Graphs without four-cycles (Q3835487):
Displayed 12 items.
- Planar Ramsey numbers for cycles (Q941377) (← links)
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size (Q970541) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- An extremal problem for cycles in hamiltonian graphs (Q1900521) (← links)
- Subdividing a graph toward a unit-distance graph in the plane (Q1971803) (← links)
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) (Q2502037) (← links)
- There are many almost strongly minimal generalized <i>n</i>-gons that do not interpret an infinite group (Q4212917) (← links)
- An Almost Strongly Minimal Non-Desarguesian Projective Plane (Q4292724) (← links)
- Some Projective Planes of Lenz-Barlotti Class I (Q4318397) (← links)