Triangle-Free Hypergraphs

Ervin Győri

doi:10.1017/s0963548305007108

ScienceGate Book Chapters

JOURNAL ARTICLE

Triangle-Free Hypergraphs

Ervin Győri

Year: 2006 Journal: Combinatorics Probability Computing Vol: 15 (1-2)Pages: 185-191 Publisher: Cambridge University Press

DOI: 10.1017/s0963548305007108

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, we give sharp upper bounds on the maximum number of edges in very unbalanced bipartite graphs not containing any cycle of length 6. To prove this, we estimate roughly the sum of the sizes of the hyperedges in triangle-free multi-hypergraphs.

Keywords:

Bipartite graph Combinatorics Mathematics Hypergraph Upper and lower bounds Complete bipartite graph Discrete mathematics Graph Mathematical analysis

Metrics

Cited By

1.55

FWCI (Field Weighted Citation Impact)

Refs

0.77

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Triangle-Free Hypergraphs

Abstract

Metrics

Citation History

Topics

Related Documents

List coloring triangle-free hypergraphs

Triangle-Free Subgraphs of Hypergraphs

Independence in uniform linear triangle-free hypergraphs

Coloring H-free hypergraphs

Coloring H‐free hypergraphs