The sparse sequences of graphs

DOI10.1007/s00373-024-02860-yMaRDI QIDQ6640961

Jianguo Qian, Sumin Huang

Publication date: 20 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graphic sequencesparse sequenceminimum edge subgraph problemsubgraph-size polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum number of disjoint pairs in set systems and related problems
• A generalization of Sperner's theorem and an application to graph orientations
• Clustering and domination in perfect graphs
• Simple hypergraphs with maximal number of adjacent pairs of edges
• Ein Satz über Untermengen einer endlichen Menge.
• A generalization of the independence number
• Detecting high log-densities
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Greedily Finding a Dense Subgraph
• A polyhedral study of the maximum edge subgraph problem
• The dense \(k\)-subgraph problem
• Different Formulations for Solving the HeaviestK-Subgraph Problem

This page was built for publication: The sparse sequences of graphs