Pages that link to "Item:Q1112832"

The following pages link to Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832):

Displaying 35 items.

• New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
• A note on the Erdős--Farber--Lovász conjecture (Q868363) (← links)
• The chromatic index of simple hypergraphs (Q1073804) (← links)
• A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← links)
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
• A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
• Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes (Q1356432) (← links)
• Motivations and history of some of my conjectures (Q1356729) (← links)
• Transitive edge coloring of graphs and dimension of lattices (Q1410403) (← links)
• Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
• Some results on an edge coloring problem of Folkman and Fulkerson (Q1587594) (← links)
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
• Chromatic index of simple hypergraphs (Q2005680) (← links)
• The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
• Constructing sparse Davenport-Schinzel sequences (Q2182209) (← links)
• Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
• Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA (Q2278810) (← links)
• A remark on the conjecture of Erdös, Faber and Lovász (Q2482329) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• On the total chromatic number of Steiner systems (Q2708239) (← links)
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
• (Q3303467) (← links)
• On two conjectures about edge-colouring hypergraphs (Q3360903) (← links)
• (Q3987044) (← links)
• Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
• Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
• (Q6076845) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
• Monomial invariants applied to graph coloring (Q6116562) (← links)
• Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)