scientific article; zbMATH DE number 89768
From MaRDI portal
Publication:4017046
Recommendations
Cited in
(25)- The maximum size of hypergraphs without generalized 4-cycles
- Graphs without \(K_ 4\) and well-quasi-ordering
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- The third Ramsey numbers for graphs with at most four edges
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- On some Ramsey numbers for quadrilaterals versus wheels
- On bipartite graphs having minimum fourth adjacency coefficient
- Wheel and star-critical Ramsey numbers for quadrilateral
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- The Turán number of directed paths and oriented cycles
- A note on the Turán function of even cycles
- On graphs and algebraic graphs that do not contain cycles of length 4
- Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle
- Extremal graphs without four-cycles or five-cycles
- Graphs without four-cycles
- scientific article; zbMATH DE number 109192 (Why is no real title available?)
- Extremal graphs of order dimension 4
- scientific article; zbMATH DE number 6906 (Why is no real title available?)
- New classes of extremal graphs with given bandwidth
- On 4-connected graphs without even cycle decompositions
- A note on 3‐partite graphs without 4‐cycles
- New bounds on the connected-pseudoachromatic index of complete graphs
- Extremal graphs without 4-cycles
- Ramsey numbers of \(C_4\) versus wheels and stars
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017046)