On Subgraphs of Bounded Degeneracy in Hypergraphs

DOI10.1007/978-3-662-53536-3_25zbMath1417.05146OpenAlexW2525221906MaRDI QIDQ3181066

Kunal Dutta, Arijit Ghosh

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53536-3_25

zbMATH Keywords

hypergraphsdegenerate graphsindependent setsrandom permutations

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Extremal problems in discrete geometry
• A note on the independence number of triangle-free graphs
• Large induced degenerate subgraphs
• A note on Ramsey numbers
• Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
• Turan's theorem for \(k\)-graphs
• Improved lower bounds on k‐independence
• A lower bound on the independence number of arbitrary hypergraphs
• On uncrowded hypergraphs
• On the independence number of sparse graphs
• New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
• Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
• Finding Large Independent Sets in Graphs and Hypergraphs
• On the General Position Subset Selection Problem

This page was built for publication: On Subgraphs of Bounded Degeneracy in Hypergraphs