Pages that link to "Item:Q3265306"

The following pages link to On maximal paths and circuits of graphs (Q3265306):

Displaying 50 items.

• Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
• Linear bounds for cycle-free saturation games (Q2153400) (← links)
• Singular Turán numbers and worm-colorings (Q2158187) (← links)
• The Turán number for \(4 \cdot S_{\ell}^1\) (Q2158193) (← links)
• On small balanceable, strongly-balanceable and omnitonal graphs (Q2158200) (← links)
• Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels (Q2166308) (← links)
• The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
• The signless Laplacian spectral radius of graphs with forbidding linear forests (Q2174499) (← links)
• Sufficient conditions for graphs to be spanning connected (Q2177900) (← links)
• The formula for Turán number of spanning linear forests (Q2185927) (← links)
• Disjoint directed cycles in directed graphs (Q2185930) (← links)
• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs (Q2197400) (← links)
• Generalized Turán problems for even cycles (Q2200921) (← links)
• The multicolour size-Ramsey number of powers of paths (Q2200928) (← links)
• Exact Ramsey numbers of odd cycles via nonlinear optimisation (Q2214084) (← links)
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
• Asymptotic density of graphs excluding disconnected minors (Q2221924) (← links)
• Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number (Q2222927) (← links)
• An analogue of the Erdős-Gallai theorem for random graphs (Q2225403) (← links)
• On the size of shadow-added intersecting families (Q2225446) (← links)
• Tilings in graphons (Q2225467) (← links)
• Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
• The Turán number of \(k \cdot S_\ell \) (Q2237229) (← links)
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
• Linear Turán numbers of acyclic triple systems (Q2237863) (← links)
• Some new results on the Turán number of star forests (Q2243288) (← links)
• Maxima of the \(Q\)-index: forbidden odd cycles (Q2250928) (← links)
• Ramsey-goodness -- and otherwise (Q2259367) (← links)
• Maxima of the \(Q\)-index: forbidden even cycles (Q2261567) (← links)
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (Q2264683) (← links)
• Matching polytons (Q2278115) (← links)
• On extremal hypergraphs for forests of tight paths (Q2279249) (← links)
• On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
• Strong cliques and forbidden cycles (Q2288223) (← links)
• Lagrangian densities of enlargements of matchings in hypergraphs (Q2294918) (← links)
• Two results about the Turán number of star forests (Q2297720) (← links)
• The shifting method and generalized Turán number of matchings (Q2297913) (← links)
• On the potential function of an arbitrary graph \(H\) (Q2297918) (← links)
• Generalized Ramsey numbers: forbidding paths with few colors (Q2309212) (← links)
• Families of finite sets satisfying intersection restrictions (Q2309551) (← links)
• On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
• The Turań number of \(2P_7\) (Q2312054) (← links)
• Avoiding long Berge cycles (Q2312601) (← links)
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
• Energy conditions for Hamiltonicity of graphs (Q2320735) (← links)
• On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
• Signless Laplacian spectral conditions for Hamiltonicity of graphs (Q2336294) (← links)
• Multicolour Ramsey numbers of paths and even cycles (Q2357225) (← links)
• Dense on-line arbitrarily partitionable graphs (Q2357776) (← links)