论文信息 - On embedding degree sequences

On embedding degree sequences

Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ that realizes $\pi_1$.

Béla Csaba | Bálint Vásárhelyi | Béla Csaba | B. Vásárhelyi

[1] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[2] Ryan R. Martin. The edit distance in graphs: Methods, results, and generalizations , 2016 .

[3] P. Erdos,et al. On the maximal number of independent circuits in a graph , 1963 .

[4] L. Lovász. Combinatorial problems and exercises , 1979 .

[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6] Jennifer Diemunsch,et al. Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem , 2015, SIAM J. Discret. Math..

[7] János Komlós,et al. Blow-up Lemma , 1997, Combinatorics, Probability and Computing.

[8] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.

[9] D. Gale. A theorem on flows in networks , 1957 .

[10] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[11] Papa Sissokho,et al. A Zero-Sum Theorem Over Z , 2012, Integers.

[12] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[13] Béla Csaba,et al. On embedding well-separable graphs , 2007, Discret. Math..

[14] János Komlós,et al. An algorithmic version of the blow-up lemma , 1998, Random Struct. Algorithms.

[15] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[16] Endre Szemerédi,et al. On the ErdÖS-Stone Theorem , 1981 .