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.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- On some three-color Ramsey numbers for paths (Q266822) (← links)
- Extension of paths and cycles for hypergraphs (Q277496) (← links)
- On fan-wheel and tree-wheel Ramsey numbers (Q297927) (← links)
- All Ramsey numbers for brooms in graphs (Q311540) (← links)
- The multicolour Ramsey number of a long odd cycle (Q322271) (← links)
- Tight cycles in hypergraphs (Q322350) (← links)
- Graph saturation games (Q324842) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- On the minimal length of the longest trail in a fixed edge-density graph (Q386380) (← links)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- On the Turán number of forests (Q396789) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
- Hypergraphs with no cycle of length 4 (Q411654) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- A Dirac theorem for trestles (Q427855) (← links)
- An Erdős-Gallai theorem for matroids (Q434226) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- Corrigendum to ``Maxima of the \(Q\)-index: forbidden odd cycles'' (Q471960) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- The Ramsey numbers of paths versus wheels: a complete solution (Q490252) (← links)
- Rainbow Turán problems for paths and forests of stars (Q510352) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- Some remarks on long monochromatic cycles in edge-colored complete graphs (Q533775) (← links)
- Graph invariants and large cycles: a survey (Q539347) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- A new class of Ramsey-Turán problems (Q607020) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- A generalization of Menger's theorem (Q654247) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- On the rainbow Turán number of paths (Q668069) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles (Q668084) (← links)
- Cycles in 2-connected graphs (Q705891) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- The Turán number of the graph \(2P_5\) (Q726648) (← links)
