Graphs without four-cycles
From MaRDI portal
Publication:3835487
Recommendations
Cites work
Cited in
(46)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- The maximum size of hypergraphs without generalized 4-cycles
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Graphs without spanning closed trails
- Polarities and \(2k\)-cycle-free graphs
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- Graphs without theta subgraphs
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- An extremal problem for cycles in hamiltonian graphs
- Graphs without dead ends
- Subdividing a graph toward a unit-distance graph in the plane
- On some Ramsey numbers for quadrilaterals versus wheels
- Optimal monomial quadratization for ODE systems
- 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
- Orthogonal polarity graphs and Sidon sets
- A note on the Turán function of even cycles
- On graphs and algebraic graphs that do not contain cycles of length 4
- Extremal graphs without four-cycles or five-cycles
- scientific article; zbMATH DE number 57426 (Why is no real title available?)
- scientific article; zbMATH DE number 89768 (Why is no real title available?)
- There are many almost strongly minimal generalized n-gons that do not interpret an infinite group
- An Almost Strongly Minimal Non-Desarguesian Projective Plane
- Some Projective Planes of Lenz-Barlotti Class I
- scientific article; zbMATH DE number 1744069 (Why is no real title available?)
- scientific article; zbMATH DE number 2145243 (Why is no real title available?)
- Sidon sets and graphs without 4-cycles
- Graphs omitting a finite set of cycles
- New classes of extremal graphs with given bandwidth
- Restricted size Ramsey number for P₃ versus cycle
- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- Bounds on the Steiner-Wiener index of graphs
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- A new notion of vertex independence and rank for finite graphs
- On 4-connected graphs without even cycle decompositions
- Upper bounds on the extremal number of the 4‐cycle
- A note on 3‐partite graphs without 4‐cycles
- Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
- On graphs without cycles of length 0 modulo 4
- On computing sets of integers with maximum number of pairs summing to powers of 2
- Extremal graphs without 4-cycles
- Ramsey numbers of \(C_4\) versus wheels and stars
- Planar Ramsey numbers for cycles
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
This page was built for publication: Graphs without four-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835487)
