Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 73 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 466 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Optimal conditions for $(L_1;L_2)$ to be forcibly bigraphic (2104.13068v1)

Published 27 Apr 2021 in math.CO

Abstract: Let $L_1=([a_1,b_1],\ldots,[a_m,b_m])$ and $L_2=([c_1,d_1],\ldots,[c_n,d_n]$) be two sequences of intervals consisting of nonnegative integers with $b_1\ge \cdots\ge b_m$ and $d_1\ge \cdots\ge d_n$. In this paper, we first give two optimal conditions for the sequences of intervals $L_1$ and $L_2$ such that each pair $(P;Q)$ with $P=(p_1,\ldots,p_m)$, $Q=(q_1,\ldots,q_n)$, $a_i\le p_i\le b_i$ for $1\le i\le m$, $c_i\le q_i\le d_i$ for $1\le i\le n$ and $\sum\limits_{i=1}m p_i=\sum\limits_{i=1}n q_i$ is bigraphic. One of them is optimal sufficient condition and the other one optimal necessary condition. We also present a characterization of $(L_1;L_2)$ that is forcibly bigraphic on sequences of intervals. This is an extension of the well-known theorem on bigraphic sequences due to Gale and Ryser

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube