Pages that link to "Item:Q2004083"

The following pages link to Maximizing the number of cliques in graphs with given matching number (Q2004083):

Displaying 16 items.

• Generalization of Erdős-Gallai edge bound (Q458592) (← links)
• The maximum number of 3- and 4-cliques within a planar maximally filtered graph (Q1783249) (← links)
• Turán problems for Berge-\((k, p)\)-fan hypergraph (Q2047221) (← links)
• Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
• The Turán number of Berge-matching in hypergraphs (Q2142638) (← links)
• On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
• On a problem of Ahlswede and Katona (Q2995575) (← links)
• Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
• (Q3706082) (← links)
• (Q4501558) (← links)
• The Turán number of Berge hypergraphs with stable properties (Q6056469) (← links)
• Some sufficient conditions for graphs being \(k\)-leaf-connected (Q6064832) (← links)
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
• The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
• Families with restricted matching number and multiply covered shadows (Q6177434) (← links)
• A note on the stability results of the number of cliques in graphs with given matching number (Q6585273) (← links)