Covering Complete Partite Hypergraphs by Monochromatic Components

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2017.08.014
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Monochromatic Components in Edge-Colored Complete Uniform Hypergraphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

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

SIAM Journal on Discrete Mathematics
Mathematics
2007English

Partitioning Infinite Hypergraphs Into Few Monochromatic Berge-Paths

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2020English

Forbidding Complete Hypergraphs as Traces

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2007English

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees

2019English

Chromaticity of Complete 4-Partite Graphs With Certain Star or Matching Deleted

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2010English

The Cartan Covering and Complete Integrability of the KdV-MKdV System

AIP Conference Proceedings
AstronomyPhysics
2001English

A Decomposition of Complete Bipartite 4-Uniform Hypergraphs K_4^{5,5} Into Loose Cycles of Length 5,10

International Mathematical Forum
2013English

Bipolar Fuzzy Hypergraphs

International Journal of Fuzzy Logic Systems
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy