Cycles of even length in graphs

Cites Work

On Graphs that do not Contain a Thomsen Graph
On some extremal problems in graph theory
Title not available (Why is that?)
Minimal Regular Graphs of Girths Eight and Twelve
Title not available (Why is that?)
Large cycles in graphs
On the structure of linear graphs
On Minimal graphs of maximum even girth

Cited In (only showing first 100 items - show all)

Graphs with few paths of prescribed length between any two vertices
Adjacency eigenvalues of graphs without short odd cycles
Maximum bisections of graphs without short even cycles
A note on short cycles in a hypercube
Color isomorphic even cycles and a related Ramsey problem
Turán numbers for hypergraph star forests
Counting H-free orientations of graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor
Forbidding multiple copies of forestable graphs
Degree Ramsey numbers for even cycles
Extremal theory and bipartite graph-tree Ramsey numbers
Bipartite algebraic graphs without quadrilaterals
Stability results for vertex Turán problems in Kneser graphs
Graph minor hierarchies
Graphs without theta subgraphs
The complete closure of a graph
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Shifted products that are coprime pure powers
Ramsey-type numbers involving graphs and hypergraphs with large girth
A hierarchy of lower bounds for sublinear additive spanners
Bipartite Turán problems for ordered graphs
Generalized Turán problems for disjoint copies of graphs
Max-bisections of $H$-free graphs
A new upper bound on extremal number of even cycles
Large cycles in large labelled graphs
Subexponential-time algorithms for finding large induced sparse subgraphs
Generalized Turán problems for even cycles
Generalized multiplicative Sidon sets
Generalized rainbow Turán problems
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
Acyclic edge-colorings of sparse graphs
The impact of locality in the broadcast congested clique model
On 14-Cycle-Free Subgraphs of the Hypercube
Extremal even-cycle-free subgraphs of the complete transposition graphs
Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Hypergraphs with Few Berge Paths of Fixed Length between Vertices
Distance colouring without one cycle length
Graphs with large maximum degree containing no odd cycles of a given length
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
Planar Turán numbers on short cycles of consecutive lengths
Planar Turán numbers of short paths
On the Number of Cycles in a Graph with Restricted Cycle Lengths
Improved upper bounds for parent-identifying set systems and separable codes
Distance colouring without one cycle length
On cycle lengths in graphs of moderate degree
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Asymptotics for the Turán number of Berge-$K_{2,t}$
Subdivisions of a large clique in $C_6$-free graphs
Making an H $H$‐free graph k $k$‐colorable
Parity check matrices and product representations of squares
Minimizing the number of edges in $\mathcal{C}_{\geq r} $-saturated graphs
On the spectrum of Wenger graphs
Title not available (Why is that?)
A strengthening on odd cycles in graphs of given chromatic number
Hypergraphs with no cycle of a given length
Long paths and cycles in random subgraphs of $\mathcal{H}$-free graphs
An extremal problem for cycles in hamiltonian graphs
Diameters and Eigenvalues
Cycles in triangle-free graphs of large chromatic number
Minimum degree conditions for monochromatic cycle partitioning
A new series of dense graphs of high girth
Turán numbers of theta graphs
Finding and counting given length cycles
The existence of even cycles with specific lengths in Wenger's graph
Graphs without cycles of even length
Hypergraph containers
Sublinear-time distributed algorithms for detecting small cliques and even cycles
On the uniqueness of some girth eight algebraically defined graphs
Four-cycles in graphs without a given even cycle
Extremal results for Berge hypergraphs
Proof of a conjecture on monomial graphs
Cycle lengths in sparse graphs
On the Turán number of some ordered even cycles
On a conjecture of Erdős and Simonovits: even cycles
On the Turán number of forests
Graph partitioning: an updated survey
On embedding of graphs into Euclidean spaces of small dimension
On resilient graph spanners
The number of $C_{2\ell}$-free graphs
Maximum cuts and judicious partitions in graphs without short cycles
3-uniform hypergraphs avoiding a given odd cycle
Geometric graphs with no self-intersecting path of length three
On cycle—Complete graph ramsey numbers
Multicolor bipartite Ramsey numbers of $K_{t, s}$ and large $K_{n, n}$
Turán problems and shadows. I: Paths and cycles
On the Turán number of theta graphs
The maximum number of triangles in $C_{2k+1}$-free graphs
On the homogeneous algebraic graphs of large girth and their applications
On an extremal hypergraph problem related to combinatorial batch codes
Extremal graphs with no $C^{4,}$s, $C^{6,}$s, or $C^{10,}$s
A conjecture of Verstraëte on vertex-disjoint cycles
First-fit colorings of graphs with no cycles of a prescribed even length
On graphs which contain all small trees
Multi-color Ramsey numbers of even cycles
Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions
A note on the Turán function of even cycles
Bisections of graphs without short cycles
A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints

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)