Some new upper bounds of ex(n;\C₃,C₄\)
From MaRDI portal
Publication:1680880
Recommendations
Cites work
- A course in combinatorics.
- A smallest graph of girth 5 and valency 6
- Extremal graphs without three‐cycles or four‐cycles
- scientific article; zbMATH DE number 109192 (Why is no real title available?)
- scientific article; zbMATH DE number 3505014 (Why is no real title available?)
- scientific article; zbMATH DE number 1409234 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation
- On Moore Graphs with Diameters 2 and 3
- On the structure of extremal graphs of high girth
- On the uniqueness of the smallest graph of girth 5 and valency 6
- There is No Irregular Moore Graph
Cited in
(7)- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- A new upper bound on extremal number of even cycles
- Constraints for symmetry breaking in graph representation
- An Upper Bound for the Hales--Jewett Number $\mathrm{HJ}(4,2)$
- Upper bounds on the extremal number of the 4‐cycle
- A note on 3‐partite graphs without 4‐cycles
- Radius \(r\) extremal graphs of girth 5
This page was built for publication: Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680880)