Pages that link to "Item:Q3265306"
From MaRDI portal
The following pages link to On maximal paths and circuits of graphs (Q3265306):
Displaying 50 items.
- Saturation spectrum of paths and stars (Q2364098) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- Disjoint complete minors and bipartite minors (Q2372437) (← links)
- The Turán number of disjoint copies of paths (Q2374168) (← links)
- On some extremal problems in graph theory (Q2396159) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- The extremal function for disconnected minors (Q2399354) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Turán numbers of complete 3-uniform Berge-hypergraphs (Q2413629) (← links)
- An Erdős-Gallai-type theorem for keyrings (Q2413630) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- The Ramsey numbers of wheels versus odd cycles (Q2439130) (← links)
- Binary matroids with no 4-spike minors (Q2440946) (← links)
- Disjoint long cycles in a graph (Q2441136) (← links)
- Revisit of Erdős-Gallai's theorem on the circumference of a graph (Q2444861) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- The Erdős-Sós conjecture for spiders (Q2462374) (← links)
- The codiameter of a 2-connected graph (Q2463471) (← links)
- Cycles and stability (Q2464153) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- A spectral condition for odd cycles in graphs (Q2477528) (← links)
- On mutually independent Hamiltonian paths (Q2488717) (← links)
- On the Turán number for the hexagon (Q2497327) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- \(\mathcal{F}\)-saturation games (Q2515577) (← links)
- Large cycles in graphs (Q2548258) (← links)
- Ramsey numbers for cycles in graphs (Q2556422) (← links)
- On the existence of triangulated spheres in 3-graphs, and related problems (Q2563170) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- On Hamiltonian bipartite graphs (Q2626464) (← links)
- On the structure of linear graphs (Q2627011) (← links)
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Extremal graphs for blow-ups of keyrings (Q2657053) (← links)
- On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\) (Q2657283) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Disjoint directed cycles with specified lengths in directed bipartite graphs (Q2659188) (← links)
- Remarks on the Erdős matching conjecture for vector spaces (Q2662794) (← links)
- Extremal graphs for edge blow-up of graphs (Q2664560) (← links)
- Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles (Q2664561) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees (Q2675869) (← links)
- The maximum spectral radius of graphs without spanning linear forests (Q2680576) (← links)
- Turán numbers of Berge trees (Q2685321) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth (Q2701404) (← links)
- The Turán number of directed paths and oriented cycles (Q2701405) (← links)
