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)

Many \(T\) copies in \(H\)-free graphs
Adjacency eigenvalues of graphs without short odd cycles
Maximum bisections of graphs without short even cycles
Graphs with few paths of prescribed length between any two vertices
On the spectrum of Wenger graphs
A note on short cycles in a hypercube
Turán numbers for hypergraph star forests
scientific article; zbMATH DE number 7053319 (Why is no real title available?)
Color isomorphic even cycles and a related Ramsey problem
A strengthening on odd cycles in graphs of given chromatic number
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
Hypergraphs with no cycle of a given length
Counting H-free orientations of graphs
On the additive complexity of some integer sequences
An extremal problem for cycles in hamiltonian graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cycles in triangle-free graphs of large chromatic number
Almost all graphs with high girth and suitable density have high chromatic number
Minimum degree conditions for monochromatic cycle partitioning
On sparse parity check matrices (extended abstract)
Random polynomial graphs for random Turán problems
Diameters and Eigenvalues
Finding and counting given length cycles
A new series of dense graphs of high girth
The existence of even cycles with specific lengths in Wenger's graph
Turán numbers of theta graphs
Hypergraph containers
Pancyclic subgraphs of random graphs
Forbidding multiple copies of forestable graphs
Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
Graphs without cycles of even length
On the uniqueness of some girth eight algebraically defined graphs
Sublinear-time distributed algorithms for detecting small cliques and even cycles
Degree Ramsey numbers for even cycles
Proof of a conjecture on monomial graphs
Extremal theory and bipartite graph-tree Ramsey numbers
Bipartite algebraic graphs without quadrilaterals
Four-cycles in graphs without a given even cycle
Cycle lengths in sparse graphs
Stability results for vertex Turán problems in Kneser graphs
Degree bipartite Ramsey numbers
Extremal results for Berge hypergraphs
On the Turán number of forests
On the Turán number of some ordered even cycles
Graph minor hierarchies
On a conjecture of Erdős and Simonovits: even cycles
On embedding of graphs into Euclidean spaces of small dimension
On even-cycle-free subgraphs of the doubled Johnson graphs
The number of \(C_{2\ell}\)-free graphs
Graph partitioning: an updated survey
Graphs without theta subgraphs
scientific article; zbMATH DE number 7765381 (Why is no real title available?)
The complete closure of a graph
Shifted products that are coprime pure powers
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Maximum cuts and judicious partitions in graphs without short cycles
How to build a pillar: a proof of Thomassen's conjecture
The Ramsey number of a long even cycle versus a star
Ramsey-type numbers involving graphs and hypergraphs with large girth
A hierarchy of lower bounds for sublinear additive spanners
Supersaturation of even linear cycles in linear hypergraphs
Chvátal-Erdős condition for pancyclicity
Bipartite Turán problems for ordered graphs
3-uniform hypergraphs avoiding a given odd cycle
Geometric graphs with no self-intersecting path of length three
Generalized Turán problems for disjoint copies of graphs
Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
Max-bisections of \(H\)-free graphs
Turán problems and shadows. I: Paths and cycles
Turán‐type problems for long cycles in random and pseudo‐random graphs
Finding even cycles even faster
On cycle—Complete graph ramsey numbers
On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
On the Turán number of theta graphs
A new upper bound on extremal number of even cycles
On locally rainbow colourings
Maximal colourings for graphs
The maximum number of triangles in \(C_{2k+1}\)-free graphs
On the homogeneous algebraic graphs of large girth and their applications
Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
On an extremal hypergraph problem related to combinatorial batch codes
Extremal results for \(C_3^-\)-free signed graphs
Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
First-fit colorings of graphs with no cycles of a prescribed even length
A conjecture of Verstraëte on vertex-disjoint cycles
Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
Subexponential-time algorithms for finding large induced sparse subgraphs
On graphs which contain all small trees
Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
On the Turán number of the blow-up of the hexagon
Large cycles in large labelled graphs
Multi-color Ramsey numbers of even cycles
Generalized Turán problems for even cycles
Generalized Turán problems for even cycles
A note on the Turán function of even cycles
Generalized rainbow Turán problems
Forbidding \(K_{2,t}\) traces in triple systems
Generalized multiplicative Sidon sets
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Bisections of graphs without short cycles

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)