Cycles of even length in graphs

Cites work

scientific article; zbMATH DE number 3232670 (Why is no real title available?)
scientific article; zbMATH DE number 3258067 (Why is no real title available?)
Large cycles in graphs
Minimal Regular Graphs of Girths Eight and Twelve
On Graphs that do not Contain a Thomsen Graph
On Minimal graphs of maximum even girth
On some extremal problems in graph theory
On the structure of linear graphs

Cited in

(only showing first 100 items - show all)

Shifted products that are coprime pure powers
Graphs without theta subgraphs
Large cycles in large labelled graphs
Ramsey-type numbers involving graphs and hypergraphs with large girth
Color isomorphic even cycles and a related Ramsey problem
Making an H $H$‐free graph k $k$‐colorable
Counting H-free orientations of graphs
Turán numbers for hypergraph star forests
Generalized Turán problems for disjoint copies of graphs
Degree Ramsey numbers for even cycles
Subexponential-time algorithms for finding large induced sparse subgraphs
On cycle lengths in graphs of moderate degree
Acyclic edge-colorings of sparse graphs
A new upper bound on extremal number of even cycles
On the Number of Cycles in a Graph with Restricted Cycle Lengths
Improved upper bounds for parent-identifying set systems and separable codes
Graphs with few paths of prescribed length between any two vertices
Generalized multiplicative Sidon sets
Adjacency eigenvalues of graphs without short odd cycles
Generalized rainbow Turán problems
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Bipartite Turán problems for ordered graphs
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
Parity check matrices and product representations of squares
The impact of locality in the broadcast congested clique model
Max-bisections of $H$-free graphs
Distance colouring without one cycle length
A hierarchy of lower bounds for sublinear additive spanners
The complete closure of a graph
Minimizing the number of edges in $\mathcal{C}_{\geq r} $-saturated graphs
Subdivisions of a large clique in $C_6$-free graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
On 14-Cycle-Free Subgraphs of the Hypercube
Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Asymptotics for the Turán number of Berge-$K_{2,t}$
Extremal even-cycle-free subgraphs of the complete transposition graphs
Maximum bisections of graphs without short even cycles
Forbidding multiple copies of forestable graphs
Extremal theory and bipartite graph-tree Ramsey numbers
Generalized Turán problems for even cycles
Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
Bipartite algebraic graphs without quadrilaterals
Planar Turán numbers on short cycles of consecutive lengths
Planar Turán numbers of short paths
Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Hypergraphs with Few Berge Paths of Fixed Length between Vertices
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
A note on short cycles in a hypercube
Distance colouring without one cycle length
Stability results for vertex Turán problems in Kneser graphs
Minimum degree conditions for monochromatic cycle partitioning
Geometric graphs with no self-intersecting path of length three
On the Turán number of some ordered even cycles
On an extremal hypergraph problem related to combinatorial batch codes
Pancyclicity of hamiltonian line graphs
On product representation of powers. I
On a conjecture of Erdős and Simonovits: even cycles
On the Turán number of forests
The number of $C_{2\ell}$-free graphs
On the Turán number of theta graphs
Cycle lengths in sparse graphs
Compact topological minors in graphs
Graph minor hierarchies
Hypergraphs with no odd cycle of given length
On the Turán Number of Generalized Theta Graphs
On the uniqueness of some girth eight algebraically defined graphs
Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
General properties of some families of graphs defined by systems of equations
The existence of even cycles with specific lengths in Wenger's graph
The maximum number of triangles in $C_{2k+1}$-free graphs
On bisections of directed graphs
Many $T$ copies in $H$-free graphs
Polarities and $2k$-cycle-free graphs
Bisections of graphs without short cycles
Monochromatic cycles in 2-coloured graphs
On some cycles in Wenger graphs
Extremal graphs with no $C^{4,}$s, $C^{6,}$s, or $C^{10,}$s
Four-cycles in graphs without a given even cycle
A conjecture of Verstraëte on vertex-disjoint cycles
Spectral extrema of graphs: forbidden hexagon
Extremal properties of regular and affine generalized $m$-gons as tactical configurations
General lemmas for Berge-Turán hypergraph problems
Long paths and cycles in random subgraphs of $\mathcal{H}$-free graphs
A new series of dense graphs of high girth
On the extremal number of subdivisions
A strengthening on odd cycles in graphs of given chromatic number
On graphs which contain all small trees
On the spectrum of Wenger graphs
On cycle—Complete graph ramsey numbers
Compactness results in extremal graph theory
Color the cycles
Explicit construction of graphs with an arbitrary large girth and of large size
Orthonormal representations of $H$-free graphs
scientific article; zbMATH DE number 7053319 (Why is no real title available?)
Lower bounds for independence numbers of some locally sparse graphs
Multi-color Ramsey numbers of even cycles
Extremal numbers of cycles revisited
Graphs without cycles of even length
Cycle lengths and minimum degree of graphs

This page was built for publication: Cycles of even length in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844243)