SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 16, Issue 3, 1996, Pages 301-311

Bipartite subgraphs

(1) Alon, Noga a

a TEL AVIV UNIVERSITY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041494491 PISSN: 02099683 EISSN: None Source Type: Journal
DOI: 10.1007/BF01261315 Document Type: Article

Times cited : (102)

References (18)

1
- 0002675107
- Explicit Ramsey graphs and orthonormal labelings
- 8pp.
- N. ALON: Explicit Ramsey graphs and orthonormal labelings, The Electronic J. Combinatorics, 1 (1994), 8pp.
- (1994) The Electronic J. Combinatorics , vol.1
- Alon, N.¹

2
- 0003430191
- John Wiley and Sons Inc., New York
- N. ALON, and J. H. SPENCER: The Probabilistic Method, John Wiley and Sons Inc., New York, 1992.
- (1992) The Probabilistic Method
- Alon, N.¹ Spencer, J.H.²

3
- 0001445733
- Extremal k-colorable subgraphs
- L. D. ANDERSEN, D. D. GRANT, and N. LINIAL: Extremal k-colorable subgraphs, Ars Combinatoria, 16 (1983), 259-270.
- (1983) Ars Combinatoria , vol.16 , pp. 259-270
- Andersen, L.D.¹ Grant, D.D.² Linial, N.³

4
- 0001301628
- Some extremal properties of bipartite subgraphs
- C. S. EDWARDS: Some extremal properties of bipartite subgraphs, Canadian Journal of Mathematics, 3 (1973), 475-485.
- (1973) Canadian Journal of Mathematics , vol.3 , pp. 475-485
- Edwards, C.S.¹

5
- 0001896094
- An improved lower bound for the number of edges in a largest bipartite subgraph
- nd Czechoslovak Symposium on Graph Theory Prague (1975), 167-181.
- (1975) nd Czechoslovak Symposium on Graph Theory Prague , pp. 167-181
- Edwards, C.S.¹

6
- 0011047371
- Problems and results in graph theory and combinatorial analysis
- J. A. Bondy and U. S. R. Murty (Eds.). Proc. Conf. Waterloo, 1977, Academic Press, New York
- P. ERDOS: Problems and results in Graph Theory and Combinatorial Analysis, in: Graph Theory and Related Topics, J. A. Bondy and U. S. R. Murty (Eds.), Proc. Conf. Waterloo, 1977, Academic Press, New York, 1979, 153-163.
- (1979) Graph Theory and Related Topics , pp. 153-163
- Erdos, P.¹

7
- 0042837335
- Some recent problems in combinatorics and graph theory
- Combinatorics and Computing, Boca Raton, Congressus Numerantium, to appear
- th Southeastern International Conference on Graph Theory, Combinatorics and Computing, Boca Raton, 1995, Congressus Numerantium, to appear.
- (1995) th Southeastern International Conference on Graph Theory
- Erdos, P.¹

8
- 0004332747
- preprint
- P. ERDOS, A. GYÁRFÁS, and Y. KOHAYAKAWA: The size of the largest bipartite subgraphs, preprint, 1995.
- (1995) The Size of the Largest Bipartite Subgraphs
- Erdos, P.¹ Gyárfás, A.² Kohayakawa, Y.³

9
- 0041835276
- preprint
- T. HOFMEISTER, and H. LEFMANN: On k-partite subgraphs, preprint, 1995.
- (1995) On K-partite Subgraphs
- Hofmeister, T.¹ Lefmann, H.²

10
- 0040321493
- Triangle-free partial graphs and edge-covering theorems
- J. LEHEL, and ZS. TUZA: Triangle-free partial graphs and edge-covering theorems, Discrete Math., 30 (1982), 59-63.
- (1982) Discrete Math. , vol.30 , pp. 59-63
- Lehel, J.¹ Tuza, Zs.²

11
- 0000375575
- Maximum k-colorable subgraphs
- S. C. LOCKE: Maximum k-colorable subgraphs, J. Graph Theory, 6 (1982), 123-132.
- (1982) J. Graph Theory , vol.6 , pp. 123-132
- Locke, S.C.¹

12
- 0002284975
- Explicit expanders, and the Ramanujan conjectures
- th ACM STOC, (1986), 240-246. See also: A. LUBOTZKY, R. PHILLIPS, and P. SARNAK: Ramanujan graphs, Combinatorica, 8 (1988), 261-277.
- (1986) th ACM STOC , pp. 240-246
- Lubotzky, A.¹ Phillips, R.² Sarnak, P.³

13
- 0000848816
- Ramanujan graphs
- th ACM STOC, (1986), 240-246. See also: A. LUBOTZKY, R. PHILLIPS, and P. SARNAK: Ramanujan graphs, Combinatorica, 8 (1988), 261-277.
- (1988) Combinatorica , vol.8 , pp. 261-277
- Lubotzky, A.¹ Phillips, R.² Sarnak, P.³

14
- 0024045909
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators
- in Russian
- G. A. MARGULIS: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Problemy Peredachi Informatsii, 24 (1988), 51-60 (in Russian). English translation in Problems of Information Transmission, 24 (1988), 39-46.
- (1988) Problemy Peredachi Informatsii , vol.24 , pp. 51-60
- Margulis, G.A.¹

15
- 0024045909
- G. A. MARGULIS: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Problemy Peredachi Informatsii, 24 (1988), 51-60 (in Russian). English translation in Problems of Information Transmission, 24 (1988), 39-46.
- (1988) Problems of Information Transmission , vol.24 , pp. 39-46

16
- 0038030939
- Bipartite subgraphs of triangle-free graphs
- S. POLJAK, and ZS. TUZA: Bipartite subgraphs of triangle-free graphs, SIAM J. Discrete Math., 7 (1994), 307-313.
- (1994) SIAM J. Discrete Math. , vol.7 , pp. 307-313
- Poljak, S.¹ Tuza, Zs.²

17
- 0000435276
- Probabilistic construction of deterministic algorithms: Approximating packing integer programs
- P. RAGHAVAN: Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, 37 (1988), 130-143.
- (1988) Journal of Computer and System Sciences , vol.37 , pp. 130-143
- Raghavan, P.¹

18
- 84990673729
- A note on bipartite subgraphs of triangle-free graphs
- J. B. SHEARER: A note on bipartite subgraphs of triangle-free graphs, Random Structures and Algorithms, 3 (1992), 223-226.
- (1992) Random Structures and Algorithms , vol.3 , pp. 223-226
- Shearer, J.B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.