#### Filter Results:

- Full text PDF available (114)

#### Publication Year

1998

2018

- This year (3)
- Last 5 years (48)
- Last 10 years (93)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dhruv Mubayi, Vojtech RÃ¶dl
- J. Comb. Theory, Ser. A
- 2002

For a family of r-graphs F , the TurÃ¡n number ex(n,F) is the maximum number of edges in an n vertex r-graph that does not contain any member of F . The TurÃ¡n density Ï€(F) = lim nâ†’âˆž ex(n,F) ( n r ) .â€¦ (More)

- Dhruv Mubayi
- Electr. J. Comb.
- 2003

Let F be a triple system on an n element set. Suppose that F contains more than (1/3 âˆ’ ) ( n 3 ) triples, where > 10âˆ’6 is explicitly defined and n is sufficiently large. Then there is a set of fourâ€¦ (More)

- Dhruv Mubayi
- J. Comb. Theory, Ser. B
- 2005

It is shown that every n vertex triple system with every pair of vertices lying in at least (1/2 + o(1))n triples contains a copy of the Fano plane. The constant 1/2 is sharp. This is the firstâ€¦ (More)

- Noga Alon, Dhruv Mubayi, Robin Thomas
- Journal of Graph Theory
- 2001

For a graph G, let a(G) denote the maximum size of a subset of vertices that induces a forest. Suppose that G is connected with n vertices, e edges, and maximum degree âˆ†. Our results include: (a) ifâ€¦ (More)

- Maria Axenovich, ZoltÃ¡n FÃ¼redi, Dhruv Mubayi
- J. Comb. Theory, Ser. B
- 2000

- Dhruv Mubayi, Yi Zhao
- J. Comb. Theory, Ser. A
- 2007

For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (râˆ’ 1)-sets of vertices of H, and d(S) is the number of vertices v such that S âˆª {v} is an edge of H. Given a family F ofâ€¦ (More)

- Dhruv Mubayi, Jacques VerstraÃ«te
- Combinatorica
- 2005

A triangle is a family of three sets A,B,C such that Aâˆ©B, Bâˆ©C, Câˆ©A are each nonempty, and A âˆ© B âˆ© C = âˆ…. Let A be a family of r-element subsets of an n-element set, containing no triangle. Our mainâ€¦ (More)

- Dhruv Mubayi
- Combinatorica
- 1998

A coloring of the edges of Kn is constructed such that every copy of K4 has at least three colors on its edges. As n â†’ âˆž, the number of colors used is eO( âˆš log n ). This improves upon the previousâ€¦ (More)

- Peter Keevash, Dhruv Mubayi
- J. Comb. Theory, Ser. B
- 2004

A cancellative hypergraph has no three edges A,B, C with Aâˆ†B âŠ‚ C. We give a new short proof of an old result of BollobÃ¡s, which states that the maximum size of a cancellative triple system isâ€¦ (More)

- Dhruv Mubayi, Jason Williford
- Journal of Graph Theory
- 2007

The ErdÅ‘s-RÃ©nyi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have beenâ€¦ (More)