The following pages link to Cycles of even length in graphs (Q1844243):
Displaying 50 items.
- On product representation of powers. I (Q1902964) (← links)
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- On some cycles in Wenger graphs (Q1987600) (← links)
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints (Q1999736) (← links)
- A new upper bound on extremal number of even cycles (Q2034066) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- On the Turán number of theta graphs (Q2053683) (← links)
- Planar Turán numbers on short cycles of consecutive lengths (Q2079819) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Forbidding multiple copies of forestable graphs (Q2175780) (← links)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs (Q2198988) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Degree bipartite Ramsey numbers (Q2233618) (← links)
- On the characterization of some algebraically defined bipartite graphs of girth eight (Q2235278) (← links)
- Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
- On even-cycle-free subgraphs of the doubled Johnson graphs (Q2242794) (← links)
- Extremal even-cycle-free subgraphs of the complete transposition graphs (Q2243230) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Generalized Turán problems for disjoint copies of graphs (Q2324501) (← links)
- Planar Turán numbers of short paths (Q2334068) (← links)
- Subdivisions of a large clique in \(C_6\)-free graphs (Q2343284) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Degree Ramsey numbers for even cycles (Q2411600) (← links)
- Stability results for vertex Turán problems in Kneser graphs (Q2415074) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
- On monomial graphs of girth eight (Q2467318) (← links)
- Shifted products that are coprime pure powers (Q2484505) (← links)
- A note on short cycles in a hypercube (Q2509296) (← links)
- Generalized multiplicative Sidon sets (Q2517148) (← links)
- Multi-color Ramsey numbers of even cycles (Q2519800) (← links)
- Forbidding \(K_{2,t}\) traces in triple systems (Q2662345) (← links)
- Bipartite Turán problems for ordered graphs (Q2678460) (← links)
- Multicolor Ramsey numbers of bipartite graphs and large books (Q2689130) (← links)
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles (Q2698445) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Graphs without cycles of even length (Q2730742) (← links)
- Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
- General properties of some families of graphs defined by systems of equations (Q2757094) (← links)
- A note on the Turán function of even cycles (Q2846723) (← links)
- Hypergraphs with no odd cycle of given length (Q2851489) (← links)
- (Q2857334) (← links)
