Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs

DOI10.1002/jgt.21653zbMath1262.05082OpenAlexW2132969890WikidataQ105583237 ScholiaQ105583237MaRDI QIDQ4920648

Yury Person, Hanno Lefmann

Publication date: 21 May 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21653

zbMATH Keywords

extremal problemsTurán graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Maximum number of sum-free colorings in finite abelian groups ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ Stability of extremal hypergraphs with applications to an edge-coloring problem ⋮ Integer colorings with forbidden rainbow sums ⋮ Hypergraphs with many Kneser colorings ⋮ A Rainbow Erdös--Rothschild Problem ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ A coloring problem for intersecting vector spaces ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Unnamed Item
• Unnamed Item
• A structural result for hypergraphs with many restricted edge colorings
• A new generalization of Mantel's theorem to \(k\)-graphs
• Quadruple systems with independent neighborhoods
• The number of graphs without forbidden subgraphs
• The Turán number of the Fano plane
• On a hypergraph Turán problem of Frankl
• On extremal problems of graphs and generalized graphs
• Almost all triple systems with independent neighborhoods are semi-bipartite
• 4-books of three pages
• A hypergraph extension of Turán's theorem
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• The typical structure of graphs without given excluded subgraphs
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Triple Systems Not Containing a Fano Configuration
• On Triple Systems with Independent Neighbourhoods
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs