On the public citation graph
A condition for matchability in hypergraphs
0 signed · 106 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02988309openalex-snapshot
On a criterion for matchability in hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90136-6openalex-snapshot
On a possible extension of Hall's theorem to bipartite hypergraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20139openalex-snapshot
Matchings in hypergraphs of large minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.20325openalex-snapshot
Acyclic systems of representatives and acyclic colorings of digraphs
inferred← citeshttps://doi.org/10.1002/jgt.20532openalex-snapshot
Hitting all maximum cliques with a stable set using lopsided independent transversals
inferred← citeshttps://doi.org/10.1002/jgt.21684openalex-snapshot
A Note on Hitting Maximum and Maximal Cliques With a Stable Set
inferred← citeshttps://doi.org/10.1002/jgt.21858openalex-snapshot
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
inferred← citeshttps://doi.org/10.1002/jgt.22004openalex-snapshot
Eigenvalues of ‐Free Graphs and the Connectivity of Their Independence Complexes
inferred← citeshttps://doi.org/10.1002/jgt.22800openalex-snapshot
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
inferred← citeshttps://doi.org/10.1002/jgt.23085openalex-snapshot
Degree criteria and stability for independent transversals
inferred← citeshttps://doi.org/10.1002/rsa.20782openalex-snapshot
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20819openalex-snapshot
Monochromatic cycle covers in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21051openalex-snapshot
Colorings, transversals, and local sparsity
inferred← citeshttps://doi.org/10.1002/rsa.21152openalex-snapshot
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1002/rsa.21216openalex-snapshot
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.70025openalex-snapshot
Reconfiguration of Independent Transversals
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_23openalex-snapshot
Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_9openalex-snapshot
Independent transversals and hypergraph matchings - an elementary approach
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_2openalex-snapshot
Fair Representation by Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_18openalex-snapshot
The Time Complexity of Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_2openalex-snapshot
Santa Claus Meets Hypergraph Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_43openalex-snapshot
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_64openalex-snapshot
The Complexity of Perfect Matching Problems on Dense Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00039-005-0516-9openalex-snapshot
Eigenvalues and homology of flag complexes and vector representations of graphs
inferred← citeshttps://doi.org/10.1007/s00224-025-10241-yopenalex-snapshot
A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem
inferred← citeshttps://doi.org/10.1007/s00373-014-1439-8openalex-snapshot
Two Disjoint Independent Bases in Matroid-Graph Pairs
inferred← citeshttps://doi.org/10.1007/s00453-018-0407-8openalex-snapshot
On (1, $$\epsilon $$ ϵ )-Restricted Max–Min Fair Allocation Problem
inferred← citeshttps://doi.org/10.1007/s00453-022-00942-yopenalex-snapshot
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
inferred← citeshttps://doi.org/10.1007/s00454-002-2792-6openalex-snapshot
Triangulated Spheres and Colored Cliques
inferred← citeshttps://doi.org/10.1007/s00493-006-0019-9openalex-snapshot
Extremal Problems For Transversals In Graphs With Bounded Degree
inferred← citeshttps://doi.org/10.1007/s00493-007-2086-yopenalex-snapshot
Independent systems of representatives in weighted graphs
inferred← citeshttps://doi.org/10.1007/s00493-017-3567-2openalex-snapshot
Finding Perfect Matchings in Bipartite Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00141-7openalex-snapshot
Improved Integrality Gap in Max–Min Allocation, or, Topology at the North Pole
inferred← citeshttps://doi.org/10.1007/s00493-025-00171-1openalex-snapshot
Blow-up Lemma for Cycles in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/s10107-012-0546-7openalex-snapshot
Semidefinite optimization in discrepancy theory
inferred← citeshttps://doi.org/10.1007/s10255-020-0962-zopenalex-snapshot
Perfect Matching in k-partite k-graphs and 3-uniform HM-bipartite Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10288-026-00628-zopenalex-snapshot
Mathematical programming approaches for social welfare maximization
inferred← citeshttps://doi.org/10.1007/s10801-009-0177-0openalex-snapshot
On finite simple groups and Kneser graphs
inferred← citeshttps://doi.org/10.1007/s11590-022-01854-0openalex-snapshot
Matching orderable and separable hypergraphs
inferred← citeshttps://doi.org/10.1007/s11856-020-1980-5openalex-snapshot
Fair splittings by independent sets in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.03.019openalex-snapshot
Separable and equatable hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.007openalex-snapshot
Coloring by two-way independent sets
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.014openalex-snapshot
d -matching in 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.005openalex-snapshot
Independence-domination duality in weighted graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114696openalex-snapshot
A reduction of the “cycles plus K4's” problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.12.009openalex-snapshot
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.001openalex-snapshot
Transversals and matchings in 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104082openalex-snapshot
Degree conditions for Ramsey goodness of paths
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.07.002openalex-snapshot
Sets of elements that pairwise generate a linear group
inferred← citeshttps://doi.org/10.1016/j.jcta.2018.04.004openalex-snapshot
Extremal hypergraphs for Ryser's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.04.003openalex-snapshot
A revival of the girth conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.03.002openalex-snapshot
The circular chromatic index of graphs of high girth
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.02.001openalex-snapshot
Independence—domination duality
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.09.005openalex-snapshot
Triangle resilience of the square of a Hamilton cycle in random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.10.001openalex-snapshot
The threshold bias of the clique-factor game
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.03.001openalex-snapshot
Improved bounds for zero-sum cycles in Z p d
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00310-xopenalex-snapshot
Almost perfect matchings in random uniform hypergraphs
inferred← citeshttps://doi.org/10.1017/apr.2021.8openalex-snapshot
A stochastic matching model on hypergraphs
inferred← citeshttps://doi.org/10.1017/s0963548301004758openalex-snapshot
A Note on Vertex List Colouring
inferred← citeshttps://doi.org/10.1017/s0963548305007157openalex-snapshot
Odd Independent Transversals are Odd
inferred← citeshttps://doi.org/10.1017/s0963548318000561openalex-snapshot
An asymptotic bound for the strong chromatic number
inferred← citeshttps://doi.org/10.1017/s0963548320000127openalex-snapshot
Finding independent transversals efficiently
inferred← citeshttps://doi.org/10.1080/00927872.2010.544275openalex-snapshot
Sets of Elements that Pairwise Generate a Matrix Ring
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03833-5openalex-snapshot
The intersection of a matroid and a simplicial complex
inferred← citeshttps://doi.org/10.1109/focs.2010.45openalex-snapshot
New Constructive Aspects of the Lovasz Local Lemma
inferred← citeshttps://doi.org/10.1112/blms.12237openalex-snapshot
Triangle‐factors in pseudorandom graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973730.90openalex-snapshot
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch126openalex-snapshot
Finding Perfect Matchings in Bipartite Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.41openalex-snapshot
Algorithms for weighted independent transversals and strong colouring
inferred← citeshttps://doi.org/10.1137/1.9781611977073.71openalex-snapshot
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch139openalex-snapshot
Kernelization for Graph Packing Problems via Rainbow Matching
inferred← citeshttps://doi.org/10.1137/1.9781611977912.100openalex-snapshot
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
inferred← citeshttps://doi.org/10.1137/110851201openalex-snapshot
Santa Claus Schedules Jobs on Unrelated Machines
inferred← citeshttps://doi.org/10.1137/23m1600384openalex-snapshot
A Precise Condition for Independent Transversals in Bipartite Covers
inferred← citeshttps://doi.org/10.1142/9789814277808_0014openalex-snapshot
Some results and questions related to the generating graph of a finite group
inferred← citeshttps://doi.org/10.1142/s0129054110007635openalex-snapshot
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY
inferred← citeshttps://doi.org/10.1145/2049697.2049702openalex-snapshot
New Constructive Aspects of the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/2229163.2229168openalex-snapshot
Santa claus meets hypergraph matchings
inferred← citeshttps://doi.org/10.1145/3070694openalex-snapshot
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
inferred← citeshttps://doi.org/10.1145/3474057openalex-snapshot
Algorithms for Weighted Independent Transversals and Strong Colouring
inferred← citeshttps://doi.org/10.2139/ssrn.6854324openalex-snapshot
Kernelization for Graph Packing and Hitting Problems via Rainbow Matching
inferred← citeshttps://doi.org/10.2989/16073606.2013.779991openalex-snapshot
Matching critical intersection hypergraphs
inferred← citeshttps://doi.org/10.2989/16073606.2016.1260069openalex-snapshot
Matching criticality in intersecting hypergraphs
inferred← citeshttps://doi.org/10.37236/12429openalex-snapshot
Constructing Graphs with No Independent Transversals
inferred← citeshttps://doi.org/10.37236/2488openalex-snapshot
Cooperative Colorings and Independent Systems of Representatives
inferred← citeshttps://doi.org/10.37236/3742openalex-snapshot
How Many Colors Guarantee a Rainbow Matching?
inferred← citeshttps://doi.org/10.3929/ethz-a-005664983openalex-snapshot
Colorings and transversals of graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-006113172openalex-snapshot
Exponential Time Complexity of SAT and Related Problems
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.118.09.777openalex-snapshot
On Forming Committees
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2016.23openalex-snapshot
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem
inferred← citeshttps://doi.org/10.46298/dmtcs.3457openalex-snapshot
Matchings and Hamilton cycles in hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1231openalex-snapshot
New Constructive Aspects of the Lovasz Local Lemma
inferred← citeshttps://doi.org/10.48550/arxiv.1010.0032openalex-snapshot
A stronger result on fractional strong colourings
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0793openalex-snapshot
How many colors guarantee a rainbow matching?
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6164openalex-snapshot
On a Generalization of the Ryser-Brualdi-Stein Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1712.03145openalex-snapshot
Monochromatic cycle covers in random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.04152openalex-snapshot
Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation
inferred← citeshttps://doi.org/10.48550/arxiv.2003.05233openalex-snapshot
Colourings, transversals and local sparsity
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09849openalex-snapshot
A polynomial time 12-approximation algorithm for restricted Santa Claus problem
inferred← citeshttps://doi.org/10.70675/a814f6d5zb810z4d3azaeedzd84379a037c9openalex-snapshot
Stochastic matching model on the general graphical structures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.