Maximum Degree and Fractional Matchings in Uniform Hypergraphs

Combinatorica - Germany
doi 10.1007/bf02579271
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Perfect Matchings in Random R-Regular, S-Uniform Hypergraphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1996English

Finding Perfect Matchings in Dense Hypergraphs

2020English

Domination Game on Uniform Hypergraphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Judicious Partitions of 3-Uniform Hypergraphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2000English

Monochromatic Components in Edge-Colored Complete Uniform Hypergraphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

‘The Asymptotic Number of Connected D-Uniform Hypergraphs’ — CORRIGENDUM

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2014English

Ramsey Properties of Random K-Partite, K-Uniform Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2007English

Asymptotics for Turán Numbers of Cycles in 3-Uniform Linear Hypergraphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy