(Q101496286)

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

title

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (English)

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

1 reference

2

1 reference

26 February 2021

1

Carlos Hoppen

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

Hanno Lefmann

3

object named as

Hanno Lefmann

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

language of work or name

English

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

publication date

February 2015

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

full work available at URL

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

0 references

published in

Discrete Mathematics

1 reference

10 August 2021

volume

338

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

issue

2

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

page(s)

262-271

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES

1

15

1 reference

SETS OF INDEPENDENT EDGES OF A HYPERGRAPH

22 February 2021

2

1 reference

On maximal paths and circuits of graphs

22 February 2021

5

1 reference

Intersection theorems for systems of finite sets

22 February 2021

6

1 reference

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

22 February 2021

7

1 reference

Hypergraphs with many Kneser colorings

22 February 2021

8

1 reference

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number

22 February 2021

9

1 reference

Hypergraph Turán problems

22 February 2021

10

1 reference

Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs: HYPERGRAPHS WITH MANY COLORINGS

22 February 2021

11

1 reference

On Colourings of Hypergraphs Without Monochromatic Fano Planes

22 February 2021

12

1 reference

A structural result for hypergraphs with many restricted edge colorings

22 February 2021

13

1 reference

The maximum number of K3-free and K4-free edge 4-colorings

22 February 2021

14

1 reference

10.1016/J.DISC.2014.10.004

22 February 2021

Identifiers

DOI

1 reference

11 November 2020

https://linkinghub.elsevier.com/retrieve/pii/S0012365X14003793

DBLP publication ID

journals/dm/HoppenKL15

1 reference

stated in

DBLP Dataset 2021-01-02