Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

DOI10.1137/140987912zbMath1323.05035OpenAlexW1835438265MaRDI QIDQ3449866

Sogol Jahanbekam, Jennifer Diemunsch, Michael Ferrara, James M. Shook

Publication date: 30 October 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://works.bepress.com/sogol-jahanbekam/11/download/

zbMATH Keywords

packingdiscrete tomographydegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (3)

A note on packing of graphic \(n\)-tuples ⋮ Stability of the Potential Function ⋮ On the bipartite graph packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic number and complete graph substructures for degree sequences
• Best monotone degree conditions for graph properties: a survey
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• A degree sequence variant of graph Ramsey numbers
• Edge disjoint placement of graphs
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Packings of graphs and applications to computational complexity
• The k-factor conjecture is true
• Packing of graphs - a survey
• Valencies of graphs with 1-factors
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• 2-factors in dense graphs
• Discrete tomography and plane partitions
• Packing \(d\)-degenerate graphs
• On Hamilton's ideals
• Packing of graphic n-tuples
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
• Hadwiger number and chromatic number for near regular degree sequences
• Uniqueness in Discrete Tomography: Three Remarks and a Corollary
• A remark on the existence of finite graphs
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Embedding Arbitrary Graphs of Maximum Degree Two
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs

This page was built for publication: Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem