The sparse sequences of graphs

DOI10.1007/S00373-024-02860-YMaRDI QIDQ6640961zbMATH OpenFDO

Authors Sumin Huang, Jianguo Qian

Publication date 20 November 2024

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

Full work available at URL https://doi.org/10.1007/S00373-024-02860-Y

zbMATH Keywords

graphic sequenceminimum edge subgraph problemsparse sequencesubgraph-size polynomial

Mathematics Subject Classification ID

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

Recommendations

• Subtrees of graphs
• Sequences Characterizing k-Trees
• The number of spanning trees in graphs with a given degree sequence
• On a sequence of sparse binomial-type polynomials
• Some properties of a class of sparse polynomials

Cites work

• A generalization of Sperner's theorem and an application to graph orientations
• A generalization of the independence number
• A polyhedral study of the maximum edge subgraph problem
• Clustering and domination in perfect graphs
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
• Different Formulations for Solving the HeaviestK-Subgraph Problem
• Ein Satz über Untermengen einer endlichen Menge.
• Greedily Finding a Dense Subgraph
• scientific article; zbMATH DE number 26490 (Why is no real title available?)
• scientific article; zbMATH DE number 3256524 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Simple hypergraphs with maximal number of adjacent pairs of edges
• The dense \(k\)-subgraph problem
• The minimum number of disjoint pairs in set systems and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640961)