Minimum degree and density of binary sequences

DOI10.1016/J.EJC.2010.01.005MaRDI QIDQ709264zbMATH OpenOpenAlexFDO

Authors Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen

Publication date 18 October 2010

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00018181/IfM_Preprint_M09_22.pdf

zbMATH Keywords

\(k\)-girthinduced subgraph of minimum degree

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• Minimum and maximum distances between failures in binary sequences
• Minimum linear span approximation of binary sequences
• scientific article; zbMATH DE number 1008452
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• De Bruijn sequences for the binary strings with maximum density
• On repetition-free binary words of minimal density
• Optimal sets of binary sequences
• scientific article; zbMATH DE number 5150220
• Minimal sequences and the Kadison-Singer problem
• A complexity measure for families of binary sequences

Cites work

• scientific article; zbMATH DE number 4073016 (Why is no real title available?)
• scientific article; zbMATH DE number 867705 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• Induced Subgraphs of the Power of a Cycle
• Long cycles in graphs with no subgraphs of minimal degree 3
• Subgraphs of minimal degree \(k\)

Cited in

(3)

• Minimum distance of logarithmic and fractional partial m-sequences
• Minimum linear span approximation of binary sequences
• On finding minimal, maximal, and consistent sequences over a binary alphabet

This page was built for publication: Minimum degree and density of binary sequences

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