The following pages link to Cycles of even length in graphs (Q1844243):
Displaying 50 items.
- On the uniqueness of some girth eight algebraically defined graphs (Q277648) (← links)
- On resilient graph spanners (Q289925) (← links)
- The number of \(C_{2\ell}\)-free graphs (Q291780) (← links)
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) (Q313830) (← links)
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- Proof of a conjecture on monomial graphs (Q346278) (← links)
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions (Q375770) (← links)
- Color the cycles (Q383778) (← links)
- On the Turán number of forests (Q396789) (← links)
- On the spectrum of Wenger graphs (Q403368) (← links)
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs (Q405113) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- Hypergraph containers (Q496210) (← links)
- The extremal function for cycles of length \(\ell\) mod \(k\) (Q510312) (← links)
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- Cycles in graphs of fixed girth with large size (Q518183) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- Spectral extrema of graphs: forbidden hexagon (Q785828) (← links)
- The existence of even cycles with specific lengths in Wenger's graph (Q942883) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Extremal theory and bipartite graph-tree Ramsey numbers (Q1112065) (← links)
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s (Q1179469) (← links)
- On embedding of graphs into Euclidean spaces of small dimension (Q1204473) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- On cycle lengths in graphs of moderate degree (Q1322247) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- Nearly bipartite graphs (Q1412666) (← links)
- Graphs without theta subgraphs (Q1633744) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Cycles in triangle-free graphs of large chromatic number (Q1743172) (← links)
- Bipartite algebraic graphs without quadrilaterals (Q1744742) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- Compactness results in extremal graph theory (Q1837701) (← links)
- Pancyclicity of hamiltonian line graphs (Q1842184) (← links)
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations (Q1869034) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- Explicit construction of graphs with an arbitrary large girth and of large size (Q1894370) (← links)
- An extremal problem for cycles in hamiltonian graphs (Q1900521) (← links)
