AROUND THE ERDÖS–GALLAI CRITERION

DOI10.15826/umj.2023.1.003OpenAlexW4385346580MaRDI QIDQ6081693

Vitaliĭ Anatol'evich Baranskiĭ, Tatiana A. Senchonok

Publication date: 5 October 2023

Published in: Ural Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/umj185

zbMATH Keywords

bipartite graphthreshold graphinteger partitionFerrers diagrambipartite-threshold graph

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Elementary theory of partitions (11P81)

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal graphical partitions
• The lattice of partitions of a positive integer
• On the shortest sequences of elementary transformations in the partition lattice
• The lattice of integer partitions
• Dominance order and graphical partitions
• Threshold graphs and related topics
• On maximal graphical partitions that are the nearest to a given graphical partition
• On the partition lattice of all integers
• A new algorithm generating graphical sequences
• Seven criteria for integer sequences being graphic

This page was built for publication: AROUND THE ERDÖS–GALLAI CRITERION