Independent dominating sets in graphs of girth five

DOI10.1017/S0963548320000279MaRDI QIDQ4993127zbMATH OpenOpenAlexFDO

Authors Ararat Harutyunyan, Paul Horn, J. Verstraëte

Publication date 15 June 2021

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548320000279

zbMATH Keywords

maximum independent setsemirandom methods

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• A note on independent domination in graphs of girth 5
• Independent dominating sets in regular graphs
• scientific article; zbMATH DE number 850313
• A note on independent domination in graphs of girth 6
• Independent domination in regular graphs

Cites work

• A note on the independence number of triangle-free graphs
• Coloring graphs with sparse neighborhoods
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3531438 (Why is no real title available?)
• scientific article; zbMATH DE number 1195776 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1875441 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• Large independent sets in regular graphs of large girth
• On the independence and chromatic numbers of random regular graphs
• On the Independent Domination Number of Random Regular Graphs
• On the ratio of optimal integral and fractional covers
• Random graphs.
• Randomized greedy algorithms for independent sets and matchings in regular graphs: exact results and finite girth corrections
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)

Cited in

(4)

• On graph fall-coloring: existence and constructions
• scientific article; zbMATH DE number 1150387 (Why is no real title available?)
• A note on independent domination in graphs of girth 5
• A tight bound for independent domination of cubic graphs without 4‐cycles

This page was built for publication: Independent dominating sets in graphs of girth five

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