The shifting method and generalized Turán number of matchings

DOI10.1016/j.ejc.2019.103057zbMath1441.05188arXiv1812.01832OpenAlexW2983444098MaRDI QIDQ2297913

Jian Wang

Publication date: 20 February 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01832

zbMATH Keywords

Erdős and Gallai theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (max. 100)

Turán numbers for hypergraph star forests ⋮ Generalized Turán number for linear forests ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Generalized Turán number of even linear forests ⋮ The maximum number of stars in a graph without linear forest ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ The generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• A method in graph theory
• The maximum number of cliques in graphs without long cycles
• Some sharp results on the generalized Turán numbers
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• On maximal paths and circuits of graphs
• On the size of graphs with complete-factors
• A generalized Turán problem and its applications
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The shifting method and generalized Turán number of matchings