Pages that link to "Item:Q411650"

The following pages link to Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650):

Displayed 8 items.

• A note on the characterization of digraphic sequences (Q383344) ‎ (← links)
• New results on degree sequences of uniform hypergraphs (Q396927) ‎ (← links)
• New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) ‎ (← links)
• The principal Erdős-Gallai differences of a degree sequence (Q2075508) ‎ (← links)
• Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays (Q2106608) ‎ (← links)
• A sharp refinement of a result of Zverovich-Zverovich (Q2339424) ‎ (← links)
• A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC (Q2986529) ‎ (← links)
• (Q5109072) ‎ (← links)