Gale-Ryser and Fulkerson–Chen–Anstee checks for degree sequences.

Open
  • Is something wrong?
#31 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
julia
Domain
data

Research direction

Review the existing Havel–Hakimi check as the nearest entry point, then read the linked Gale–Ryser and Fulkerson–Chen–Anstee theorem references. Define checks for bipartite and directed degree sequences, with completion requiring both theorem-based cases to be supported.

Written by the indexing model from the issue text.

Description

Now that we have Havel Hakimi, it'd be good to have analog for the bipartite graph and directed graph.
(https://en.wikipedia.org/wiki/Gale%E2%80%93Ryser_theorem)
and
https://en.wikipedia.org/wiki/Fulkerson%E2%80%93Chen%E2%80%93Anstee_theorem
Although the second seems very close to the former.

Dominant language
Julia
Stars
110
Forks
25
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from JuliaGraphs/MatrixNetworks.jl

All issues in JuliaGraphs/MatrixNetworks.jl

Similar issues

More Julia issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.