Hypergraphs With Few Berge Paths of Fixed Length Between Vertices

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/18m1203389
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Partitioning Infinite Hypergraphs Into Few Monochromatic Berge-Paths

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2020English

A Note on Ramsey Numbers for Berge-G Hypergraphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Neighborhood Fixed Pendant Vertices

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1981English

Extension of Paths and Cycles for Hypergraphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2014English

What Paths Have Length?

Fundamenta Mathematicae
Number TheoryAlgebra
1949English

Berge Furre

Arbeiderhistorie
SociologyPolitical ScienceHistory
2017English

Correction To: Distance Between Vertices of Lattice Polytopes

Optimization Letters
ControlOptimization
2020English

A Few More Minutes Make a Difference? The Relationship Between Content and Length of GP Consultations

Scandinavian Journal of Primary Health Care
EnvironmentalPublic HealthOccupational Health
2013English

Avoiding Long Berge Cycles

Journal of Combinatorial Theory. Series B
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