Cycles of even length in graphs
From MaRDI portal
Publication:1844243
DOI10.1016/0095-8956(74)90052-5zbMath0283.05108OpenAlexW1987996179WikidataQ56698339 ScholiaQ56698339MaRDI QIDQ1844243
J. A. Bondy, Miklós Simmonovits
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(74)90052-5
Related Items (only showing first 100 items - show all)
Monochromatic Cycles in 2-Coloured Graphs ⋮ The Maximum Number of Triangles in C2k+1-Free Graphs ⋮ Hypergraphs with No Cycle of a Given Length ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Counting H-free orientations of graphs ⋮ Pancyclic subgraphs of random graphs ⋮ Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ⋮ On the Extremal Number of Subdivisions ⋮ Unnamed Item ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Linear cycles of consecutive lengths ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Extremal numbers for cycles in a hypercube ⋮ A simple proof for the lower bound of the girth of graphs \(D(n,q)\) ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ A new series of dense graphs of high girth ⋮ Bipartite-ness under smooth conditions ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles ⋮ Graph partitioning: an updated survey ⋮ On sparse parity check matrices (extended abstract) ⋮ Random polynomial graphs for random Turán problems ⋮ Graphs with few paths of prescribed length between any two vertices ⋮ On the Turán Number of Generalized Theta Graphs ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ The Ramsey number of a long even cycle versus a star ⋮ Bisections of Graphs Without Short Cycles ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ Extremal Results for Berge Hypergraphs ⋮ Large cycles in large labelled graphs ⋮ Unnamed Item ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ Discrete spheres and arithmetic progressions in product sets ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Finding even cycles even faster ⋮ A Conjecture of Verstraëte on Vertex-Disjoint Cycles ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On 14-Cycle-Free Subgraphs of the Hypercube ⋮ Compact topological minors in graphs ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ Four-cycles in graphs without a given even cycle ⋮ Turán theorems for even cycles in random hypergraph ⋮ On cycle—Complete graph ramsey numbers ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Distance Colouring Without One Cycle Length ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ Supersaturation of even linear cycles in linear hypergraphs ⋮ Extremal Numbers of Cycles Revisited ⋮ Turán numbers of theta graphs ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles ⋮ Unnamed Item ⋮ On the Turán Number of the Blow-Up of the Hexagon ⋮ The complete closure of a graph ⋮ Turán problems for integer-weighted graphs ⋮ Diameters and Eigenvalues ⋮ Turán numbers for hypergraph star forests ⋮ On the uniqueness of some girth eight algebraically defined graphs ⋮ Geometric graphs with no self-intersecting path of length three ⋮ On resilient graph spanners ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Graphs without theta subgraphs ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) ⋮ Generalized rainbow Turán problems ⋮ Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ An extremal problem for cycles in hamiltonian graphs ⋮ On product representation of powers. I ⋮ Proof of a conjecture on monomial graphs ⋮ Extremal theory and bipartite graph-tree Ramsey numbers ⋮ On the Turán number of some ordered even cycles ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ Forbidding multiple copies of forestable graphs ⋮ Color the cycles ⋮ Degree Ramsey numbers for even cycles ⋮ Cycle lengths and minimum degree of graphs ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ On the Turán number of forests ⋮ On the spectrum of Wenger graphs ⋮ Bipartite Turán problems for ordered graphs ⋮ Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs ⋮ Distance colouring without one cycle length ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ Multicolor Ramsey numbers of bipartite graphs and large books ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Generalized Turán problems for even cycles ⋮ Nearly bipartite graphs ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Orthonormal representations of \(H\)-free graphs ⋮ Triangles in graphs without bipartite suspensions ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
Cites Work
This page was built for publication: Cycles of even length in graphs
