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)

On the homogeneous algebraic graphs of large girth and their applications
Extremal theory and bipartite graph-tree Ramsey numbers
Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
On embedding of graphs into Euclidean spaces of small dimension
On graphs which contain all small trees
Polarities and \(2k\)-cycle-free graphs
On cycle lengths in graphs of moderate degree
Acyclic edge-colorings of sparse graphs
Maximum cuts and judicious partitions in graphs without short cycles
Graphs with large maximum degree containing no odd cycles of a given length
Nearly bipartite graphs
Graphs without theta subgraphs
On the Turán number of some ordered even cycles
Cycle lengths and minimum degree of graphs
Distance colouring without one cycle length
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Cycles in triangle-free graphs of large chromatic number
Bipartite algebraic graphs without quadrilaterals
Graph minor hierarchies
Cycles of given lengths in hypergraphs
Compactness results in extremal graph theory
Pancyclicity of hamiltonian line graphs
Extremal properties of regular and affine generalized m-gons as tactical configurations
Geometric graphs with no self-intersecting path of length three
Explicit construction of graphs with an arbitrary large girth and of large size
An extremal problem for cycles in hamiltonian graphs
On product representation of powers. I
Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
General lemmas for Berge-Turán hypergraph problems
On some cycles in Wenger graphs
A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
A new upper bound on extremal number of even cycles
Subexponential-time algorithms for finding large induced sparse subgraphs
On the Turán number of theta graphs
Planar Turán numbers on short cycles of consecutive lengths
Turán numbers for hypergraph star forests
Generalized rainbow Turán problems
Sublinear-time distributed algorithms for detecting small cliques and even cycles
Forbidding multiple copies of forestable graphs
Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
Generalized Turán problems for even cycles
Orthonormal representations of \(H\)-free graphs
Improved upper bounds for parent-identifying set systems and separable codes
Minimum degree conditions for monochromatic cycle partitioning
Maximum bisections of graphs without short even cycles
Degree bipartite Ramsey numbers
On the characterization of some algebraically defined bipartite graphs of girth eight
Adjacency eigenvalues of graphs without short odd cycles
On even-cycle-free subgraphs of the doubled Johnson graphs
Extremal even-cycle-free subgraphs of the complete transposition graphs
Max-bisections of \(H\)-free graphs
Asymptotics for the Turán number of Berge-\(K_{2,t}\)
Generalized Turán problems for disjoint copies of graphs
Planar Turán numbers of short paths
Subdivisions of a large clique in \(C_6\)-free graphs
On bisections of directed graphs
Degree Ramsey numbers for even cycles
Stability results for vertex Turán problems in Kneser graphs
On a conjecture of Erdős and Simonovits: even cycles
On monomial graphs of girth eight
Shifted products that are coprime pure powers
A note on short cycles in a hypercube
Generalized multiplicative Sidon sets
Multi-color Ramsey numbers of even cycles
Forbidding \(K_{2,t}\) traces in triple systems
Bipartite Turán problems for ordered graphs
Multicolor Ramsey numbers of bipartite graphs and large books
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Triangles in graphs without bipartite suspensions
Breaking the degeneracy barrier for coloring graphs with no K_t minor
Graphs without cycles of even length
Almost all graphs with high girth and suitable density have high chromatic number
General properties of some families of graphs defined by systems of equations
On the uniqueness of some girth eight algebraically defined graphs
A note on the Turán function of even cycles
Hypergraphs with no odd cycle of given length
Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
Monochromatic cycles in 2-coloured graphs
The maximum number of triangles in \(C_{2k+1}\)-free graphs
Hypergraphs with no cycle of a given length
Pancyclic subgraphs of random graphs
The number of \(C_{2\ell}\)-free graphs
Compact topological minors in graphs
The complete closure of a graph
Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
Turán problems for integer-weighted graphs
First-fit colorings of graphs with no cycles of a prescribed even length
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
A conjecture of Verstraëte on vertex-disjoint cycles
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
Proof of a conjecture on monomial graphs
On 14-Cycle-Free Subgraphs of the Hypercube
Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
Diameters and Eigenvalues
Color the cycles
On the Turán number of forests
On the spectrum of Wenger graphs
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
Large cycles in large labelled graphs
On cycle—Complete graph ramsey numbers

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)